I don't remember how many videos I have watch to understand DFS/BFS but I was unable to understand the concept.... This is the best Explanation I have ever watched on RUclips for DFS and now the concept is crystal clear to me.... Thanks a lot dude for doing that much for us !!!....
⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡ MOST POWER EXPLAIN EVER GOT this was One of your own best videos in terms of giving us very deep insight of "Everyone is doing , but why we are doing so : ) " from other video I only got to know how to code DFS here I learned what controls I can have to modify DFS that part was best 🔥🔥🔥🔥🔥
Actually without telling about void->bool of dfs you "returned isLoopExists" . so I have added the code for who haven't understood: #include using namespace std; const int N=10e5; bool vis[N]={0};//initialize all the the visited array value as 0 which means false vector graph[N]; void makelink(int s,int d){ graph[s].push_back(d); graph[d].push_back(s); } void dfs(int v){ cout
I have watched almost all videos of your playlist. when i started watching your videos i thought how nice it would be you if i watch your tree and graph series now that dream come true ; just because of you it will be simple and easy for me to learn graph and trees. Thanks you for such a nice content for free 🙏😊
What an explanation buddy.. thank you soo much.. your channel is the first tutorial whose forcefully made me commenting an applause.. Great explanation keep blessings...
Oh my god. This is the most amazing video I saw on DFS. I saw this video few months ago and at that time my Hindi was not that good(I am from south) so I skipped this video. This video made me regret not learning Hindi in my high school. Luv bhai with so much love from Andhra. God bless you.
There are alot of people who write hate comments on your content,I just wanna say,u r doing a good work,be proud of it N wish you all love!! ❤️❤️ - Rahul Balani 🙂
Sir as a newbie I am struggling a lot with recursion and dp. Can you pls share some tips on how you mastered these two topics and where did you practice from..I would really appreciate it.. Btw thanks for the graph series..
i have made videos on recursion so watch them for more clarity, also both recursion and dp require a lot of practice for getting used to so write a lot of code and solve lot of questions related to them
💛 Agar aise DP v karwa dogey Bhai dil jeet logey Tumhara naam LUV k jaga DILJEET hona chahiye tha Kya kamal ka intution bataya Mera recursion ka v concept clear kardiya 2nd,3rd section k step se 🔥Waiting for DP to be completed before March
I have a genuine doubt. In the line " vector g[N] ;" Are we declaring a vector "g" of size N ? or Are we declaring N vectors - like g[0] , g[1], g[2], g[3],......g[N] ?
Bhaiya graph me jaise yadi more 1 se 2,4 ar 5th node connected h to yadi hum 'dfs' chalayenge to print 1,2,..... Print hoga par aisa bhi to ho sakta h ki 1,4,..... Or 1,5,...... Print ho to kya ans sahi hoga
endsem start hone wale h...isme jo DFS btaya h ..... different output de ra h ..and jo material teacher ne dia h...usme LIFO use krr kr output diya h.....pura confusing h last time pe😣😣.....kya follow kru?
I am not able to understand the time complexity of the above DFS function. Why O(V)is added? Let 1 vertex E1 edge another vertex E2 edges. 3rd vertex E3 edges. TC=O(E1+E2+E3)=O(E).💛💛💛💛💛💛
Thank you greatly 💛 explained but I think some of the part of video is trimmed !!!! how do we call the dfs function from main like which vertex we have to pass to dfs function for calling?? or may start vertex will be given in question itself?!
18:38 Koi ye batyega kya ki const int N = 1e5+10 mei +10 kyo likhe? 1e9+7 mei to pata hai +7 prime number banne ke liye per baaki jagh kyo likha jaata hai + ke baad number 🤔
I don't remember how many videos I have watch to understand DFS/BFS but I was unable to understand the concept....
This is the best Explanation I have ever watched on RUclips for DFS and now the concept is crystal clear to me....
Thanks a lot dude for doing that much for us !!!....
Yes 👌👌
Could you please send the code he used in the video? I am getting a segmentation fault.
⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡⚡
MOST POWER EXPLAIN EVER GOT
this was One of your own best videos in terms of giving us very deep insight of "Everyone is doing , but why we are doing so : ) "
from other video I only got to know how to code DFS
here I learned what controls I can have to modify DFS
that part was best 🔥🔥🔥🔥🔥
I my time I have seen few teacher who able deliver knowledge clearly to students and luv is one of them . 💛
Literally this is the best DFS explanation I have ever seen....
Actually without telling about void->bool of dfs you "returned isLoopExists" . so I have added the code for who haven't understood:
#include
using namespace std;
const int N=10e5;
bool vis[N]={0};//initialize all the the visited array value as 0 which means false
vector graph[N];
void makelink(int s,int d){
graph[s].push_back(d);
graph[d].push_back(s);
}
void dfs(int v){
cout
Thanks a ton brother.
DFS was amazing desperately waiting for BFS sir please please please post it asap.
I have watched almost all videos of your playlist.
when i started watching your videos i thought how nice it would be you if i watch your tree and graph series now that dream come true ;
just because of you it will be simple and easy for me to learn graph and trees. Thanks you for such a nice content for free 🙏😊
What an explanation buddy.. thank you soo much.. your channel is the first tutorial whose forcefully made me commenting an applause.. Great explanation keep blessings...
One of the best explanation of DFS in the entire yutube ...thank you LUV
Oh my god. This is the most amazing video I saw on DFS. I saw this video few months ago and at that time my Hindi was not that good(I am from south) so I skipped this video. This video made me regret not learning Hindi in my high school. Luv bhai with so much love from Andhra. God bless you.
Thank you very much bhaiya for this free content
Thanks is not enough for you man..... ❤️❤️Doing somthing really gr8 for middle class kids...you don't know fam..🙌...
seriously you are highly dedicated to make us understand the topic.
Easiest explanation on youtube
Really, One of my friend recommend me your channel for Graph, and It is really awesome keep working brother. we are with you.
Best DFS ever , crystal clear explanation
finally i understood dfs and it was possible only because of u sir
I am actually not commenting in any video lecture but this explained and it hits in my mind very properly ,
best explanation of dfs very nice.
seriously you are highly dedicated to make us understand the topic.
Awesome explanation..!!
Bhaiya this a very helpful for all of us thank you for making this content for free💛💛
the best possible logic for solving such qs. Love your explanation
your are explaining the topic in better way . I love that 🙏
💛💛💛💛💛💛ek kyu mai to dherr sare heart dunga.... Bahut accha samjhaya apne, thanks.
Thanks a lot for your effort. I know a thank is very negligible compared to what you have given us. Keep carrying on!
The way you elaborate each step of any algo is great. ✌✌
i just learnt what the importance of why.. just incredible sir🙇♂
Legend is back
😂😂😂😂😂😂😂😂
return type void se bool bina kisi notice ke kar diye 😆🤔
void dfs() se bool dfs()
BTW 💛
best dfs video on internet 🙌
Ek hi dil hi yaar kitne baar jeetoge 💛💛
Your explanation is powerful
This was the best video on DFS
🥰🥰🥰Graph easy lgane lga ab iss video ko dekhkar🥰🥰🥰
saare channels pe dekha pr sbse easy treeka yhi tha
👌👌👌👌👌
Best explanation
Much better then many courses
you are really a genius keep it up man. your videos are really awesome.
Best explanation of DFS. Waiting for upcoming videos on graph 💛💛
what an explanatation... great work
Great Explation. You made it simple bro
very good explaination💛💛
There are alot of people who write hate comments on your content,I just wanna say,u r doing a good work,be proud of it N wish you all love!! ❤️❤️
- Rahul Balani 🙂
People who do good stuff are the ones that are hated the most.
Sir as a newbie I am struggling a lot with recursion and dp. Can you pls share some tips on how you mastered these two topics and where did you practice from..I would really appreciate it.. Btw thanks for the graph series..
i have made videos on recursion so watch them for more clarity, also both recursion and dp require a lot of practice for getting used to so write a lot of code and solve lot of questions related to them
@@iamluv need more video on recursion and backtracking
See, kunal kushwaha recursion video
Plz upload some question solving videos.
Plz upload the next graph video as soon as possible to u.
By far best explaination👍👍
Awesome as always💛💛💛💛
💛
Agar aise DP v karwa dogey
Bhai dil jeet logey
Tumhara naam LUV k jaga DILJEET hona chahiye tha
Kya kamal ka intution bataya
Mera recursion ka v concept clear kardiya 2nd,3rd section k step se
🔥Waiting for DP to be completed before March
Op explanation 💕💕🔥🔥 pls continue series.....
Baaap explanation 🤩🤩
Bahut badhiya samjhate ho ap 🤗🤗🤗
explanation level ✅✅✅up to the limit.... tnx man ♥️
Hats off to u luv bhayia, hows the josh⚡⚡💪🏼
💛💛💛💛Next Level Thankyou Luv bhaiya.
💛beautiful explanation
Luv vai ❤️ from 🇧🇩
bhaishab mze aagye😍😍😍
In adjancency list of unweighted graph , i think, we have to use vector ??
Now dfs is clear to me. 💛💛💛💛
Thanks a lot for the best explanation
I have a genuine doubt. In the line " vector g[N] ;" Are we declaring a vector "g" of size N ? or Are we declaring N vectors - like g[0] , g[1], g[2], g[3],......g[N] ?
we are declaring N vectors, you should check my vector video in stl playlist
💛💛
Amazing Work Bro
Great explanation!
💛💛
thank you sir ! much needed vide0
Function ka return type bool kaise hua??...aur isLoopExists kaha se aya??
simply best..
Awesome explanation👌
Very good explanation
Explanation level : God 🔥
😂😂😂😂😂😂
💛🧡💛
great explanation! 💯
Amazing video bro love it♥️♥️.Dynamic programming ke upar bhi videos banao na.
Wow , 🤩. Nice Explained...
💛💛💛💛💛💛💛 Awesome explanation..!!
Bhaiya graph me jaise yadi more 1 se 2,4 ar 5th node connected h to yadi hum 'dfs' chalayenge to print 1,2,..... Print hoga par aisa bhi to ho sakta h ki 1,4,..... Or 1,5,...... Print ho to kya ans sahi hoga
Great video💛
Very Informative Video
Bhaiya ek video ka request hai Merge sort for linked list ...buhut prob horaha hai please...
you are the best BOSS !!!
Thanks for the video 💛
Thank you sir 💛
Awesome 🔥
best on youtube
best explanation sir
😂😂😂😂😂😂😂
return isLoopExists, ye kahan se aya
Sir hume pehle tree padna cheye ya firr graph padna cheye
endsem start hone wale h...isme jo DFS btaya h ..... different output de ra h ..and jo material teacher ne dia h...usme LIFO use krr kr output diya h.....pura confusing h last time pe😣😣.....kya follow kru?
I am not able to understand the time complexity of the above DFS function. Why O(V)is added?
Let 1 vertex E1 edge
another vertex E2 edges.
3rd vertex E3 edges.
TC=O(E1+E2+E3)=O(E).💛💛💛💛💛💛
How about this -> V1 + E1 + V2 + E2 + V3 + E3 ...
Can be rewritten as (V1 + V2 ...Vn) + (E1 + E2...En) = O(V+E)
@@mystikyogi thanks now I got it. Thanks for the reply
bro got a haircut in the middle of a video
Eagerly waiting for new videos..
💛nyc video sir
31:18 cutting kar li
Thank you greatly 💛 explained but I think some of the part of video is trimmed !!!! how do we call the dfs function from main like which vertex we have to pass to dfs function for calling?? or may start vertex will be given in question itself?!
18:38
Koi ye batyega kya ki const int N = 1e5+10 mei +10 kyo likhe?
1e9+7 mei to pata hai +7 prime number banne ke liye per baaki jagh kyo likha jaata hai + ke baad number 🤔
That's a habit if his. He's said that in a previous video.
Thank you so much ! 💛
what is the return isLoopExists in the end of the DFS code?
luv you brother!!!!!!
Bro,won't it be
vector g[N]?
Can you share the information about the writing tablet you use
?
bhai ek sath 1000 like ka option nhi hai kya
Awessome Explanation bhai
Bhaiya if weighted graph adjacency list mai dfs kaise lagaenge
Red heart chhodenge 😄
❤️
Which line denotes back tracking from 2 to 6 and so on?