Bro i m sorry but u really underated youtuber and teacher..... I had purchased courses of gfg and udemy....and they really suck!.... this happened bcoz...they only want to sell their nuisance courses...but ...ur teaching skill is really awesome...u go in deep... that's makes me stress less...and understand....
yes bhaiya maine last question ke code ko 2 times copy pe likha khud se and har ke function ko chala chala ke dekha.......literally speaking maja aa gya
Correction : In the code of DFSRec function, Visited boolean vector must by pass by reference because of its changes must be reflect in DFS funtion. Thanks...!!
@@HelloWorldbyprince sir I am referring your channel from last few months now I am very good at DSA . BUT sir I got less than 60 due to healt issue in 12th now college is not allowing me for placement drive 😭 what should I do. Plz help
#include #include using namespace std; void add(vector v[] , int s , int e){ v[s].push_back(e); v[e].push_back(s); } void disp(vector v[] , int s){ for(int i = 0 ; i < s ; i++){ cout
Bro i m sorry but u really underated youtuber and teacher.....
I had purchased courses of gfg and udemy....and they really suck!.... this happened bcoz...they only want to sell their nuisance courses...but ...ur teaching skill is really awesome...u go in deep... that's makes me stress less...and understand....
Thanks a lot for supporting me buddy
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Pure youTube pe se kisi ne agr graph ki feel dilai hai to wo aap ho bhaiya...... Sache dil se aapko thank u💕
undoubtedly, the best series of graph on youtube
Thanks a lot Sahil 🔥 Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Solved the assignment question with complete step by step process and understanding.
Thanks for this awesome tutorial and guidance.
Best Free of Cost DSA Course on TH-cam ! Following it in Python! 🔥🔥🔥!
this series is only the series where I felt confident in graph great explanation
Thanks yaar ...issi trah se bass aap share kardo
same me
yes bhaiya maine last question ke code ko 2 times copy pe likha khud se and har ke function ko chala chala ke dekha.......literally speaking maja aa gya
tum sach me aacha kar rhe ho yaar
@@HelloWorldbyprince tq bhaiya
Mja aa gya, aap achhe se btate hai aur motivate krte hai
Bhaiya baki sab padhate hai... but aap practice bhi karwate ho🔥
Thank you Bhaiya💕
Thanks for supporting Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
i have done the last disconnected graph and i am very happy because your explaination is so nice thanks a lot ♥♥♥♥♥♥
Thank you bhaiya ... please keep growing keep doing...best graph series on TH-cam...u go in deep thankyou ❤️
Correction : In the code of DFSRec function, Visited boolean vector must by pass by reference because of its changes must be reflect in DFS funtion. Thanks...!!
got it
@Amit Gupta Thanks 100000000.
Great explanation and covered all the examples....🔥
Glad you liked it!
kya sahi explanation hai apki 🔥
mai bhi ranchi jharkhand se hu
thanks bhaiya aapse graph padhne me mja aa rha hai
Great bhaiya and solved all the examples......❣❤🔥
Waoo good work buddy
nice video sir ab Jake samajh aya bfs aur dfs ache se 🔥 🔥
Bass yahi sunnna tha mujhe 🥰🥰😎
Awesome way of teaching ,Sir.
Thanks sahil
i am doing graph in dec 2022 from your playlist awesome videos :)😍😍
That's awesome!
Thank you, learning graphs from you!
Sir , u are awesome 🔥💯❤️
Thanks 👍 buddy
Bhaut acha lga video bhaiya ❤🎉
Bahut accha lga bhaiya smj aagya 🙏🙏
😎😎
Thanks sir it was the best explanation of code
Thanks for the support and love
blessed to be landing on this channel
Hahah keep learning bro Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Very well explained, thank you for this.
Thanks sakshi
Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
@@HelloWorldbyprince I will surely do
ek hein baar mein DFS samajh aa gaya.
Wahhhh gajab
very good teaching sir. lots of learning
Keep watching
Very nicely explained
Video achha laga, bhaiya
Finally 😎 u liked it maannnn
Just love this series...!!!👍
Keep it up 👍
Nice explanation ❤I have done the homework problem
good job
Kya mast padhate ho bhai 🔥🔥
Thanks yaar 😊
Bass share kardo vishesh ...so that I got more booster
Amazing explained!.
Keep learning
crystal clear😍
great video Bhaiya thanks for creating this amazing content
Thank you so much 😀
Awesome!!!!!😇
Yeah 👍👍
great explanation bhai !!
Thanks 🙂
Great Vid bro😍
Thanks 🔥
bhai literally best playlist on graph
mast samjhaya hai bhaiya
14:51 example code, my answer for DFS is, 0 1 3 2 4, order doesn't matter correct?
then, whats the order according to you?
very insightful!!
Glad you think so!
wonderful explanation
Glad you liked it!
Good work buddy
Thanks yaar
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Can't we pass vectorvisited as reference?
We can pass
yess u can
I think you should
Hi Prince wont you think that this approach would not give correct and in the case when their is directed graph, i have that confusion
great content
bhaiya maine mehnat kia and mja aagya
Are wahhh nice
best video
Yess I did it 🤣
thanks sir ,i got it genuinely
waoo yaar good
Maza aa gya bhaiya
nice yaar
Thank you 100000000000 times
Hahahahaa, Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
helped a lot!!
I did ur 6task one by one also the last one 👌
amazing sayan
please make this kind of series on DP also, it would be great.
Haanji sure
what is the work of s in DFS function
great video thanks sir
Thanks pls share this video in your college and friends
@@HelloWorldbyprince sir I am referring your channel from last few months now I am very good at DSA . BUT sir I got less than 60 due to healt issue in 12th now college is not allowing me for placement drive 😭 what should I do. Plz help
aap to bilkul ek bade bhaiya ki tarah padhate ho
thanks
i have done my homework
nice buddy
continue kar rahe bhaiya
amazing
thank u
Nice video🙂
github.com/Prince-1501/Complete-DSA-Preparation
bas unconnected graph mein kuch nahi bas pehle wala loop fir se chalta when n=5 and then same as jaise connected graph mein karte the.
Awesome🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏😘😘🆗🆗✔✔
Thanks 🤗
Love from Pakistan🫀🫀🫀
great
Awesome yaar
8/32 done (3.11.22)
nice bro
done vhi
helpful
Thanks a lot please share my channel with your friends
nice
Thanks
dry run done for last question
Nice yaar
Bhut consistent ho tum ...sahi jaa rahe hk
Please make a video on DFS implementation using Stack!
ok i will
done
Cooding achche se dikh ni rha bro
learning
good bro
#include
#include
using namespace std;
void add(vector v[] , int s , int e){
v[s].push_back(e);
v[e].push_back(s);
}
void disp(vector v[] , int s){
for(int i = 0 ; i < s ; i++){
cout
can anyone share the code
In future videos it's there dude
More videos
Ekdum sure
bhaiya stack use kr k q nhi batai isme
please explain code in C also
sure i will try
Can you provide the code sir
come with dp...... plz bhaaiya
Hahah time do brother i will
Syad koi nhi smj skta ek bro ki program
#include
using namespace std;
void dfs(vector adj[],int v, vector &visited){
visited[v] = true;
cout
#include
using namespace std;
void addedge(vector adj[], int v, int u)
{
adj[v].push_back(u);
adj[u].push_back(v);
}
void dfsRec(vector adj[], int s, vector &visited)
{
visited[s] == true;
cout
nice playlist bro
keep on going like that
Thanks, will do!
sorry
bhaiya actually wanna get some important advice from you so how can i contact you?
his telegram grp
Very well explained, thank you for this.
You're very welcome!
Great explanation
Thanks
done
fantastic work