Very nice, I love how both data structures and algorithm was introduced with code example of it. It needs to be said that visual is very different intuitively from the code itself.
What is time complexity of both algoritams and when do I use dfs or bfs, how do I know wich one is better? My main language for cp is C++ can I use map to create a graph as well? Edit: Great video I really understood everything.
Thanks for pointing it out. For better and simple understanding we have taken a directed and acyclic graph ie. having no loops intentionally. For in-depth knowledge you can check out the next video (th-cam.com/video/pCmsQVHYXK0/w-d-xo.html) or our Graph Playlist (th-cam.com/play/PLqM7alHXFySEaZgcg7uRYJFBnYMLti-nh.html&si=UodnBXB5Z9LhZNib) where we have covered different types of graph and we have included the concept of tracking visited nodes.
Hey thanks for the basic covering, but I am wondering why you are not discussing which one to use, where to use and why to use ? Why are you not showcasing time complexity with each approach ? 🙂
Dude you have got to say things for us beginners like: What is this coding application you are using? Where can I download it? What extra add-ons were there if any? Like I code on Visual Studio will this work there? Who knows? Maybe? Should I hand by hand type in everything you put since you didn't link scripts? No I won't
We are using Python in this particular video. But you can follow up with any language of your choice. If you are a beginner and want to follow line by line you can use any IDE be it your VS Code or our GFG online IDE (ide.geeksforgeeks.org/online-python3-compiler). Any compiler that supports python will be sufficient.
This was clear and concise. Thank you.
Very nice, I love how both data structures and algorithm was introduced with code example of it. It needs to be said that visual is very different intuitively from the code itself.
What is time complexity of both algoritams and when do I use dfs or bfs, how do I know wich one is better? My main language for cp is C++ can I use map to create a graph as well?
Edit: Great video I really understood everything.
Sucksex is coming 🎉
There is a bug in this code, track the already visited nodes so that if there are multiple adjacent nodes, then the traversal will be infinite!!
Thanks for pointing it out.
For better and simple understanding we have taken a directed and acyclic graph ie. having no loops intentionally. For in-depth knowledge you can check out the next video (th-cam.com/video/pCmsQVHYXK0/w-d-xo.html) or our Graph Playlist (th-cam.com/play/PLqM7alHXFySEaZgcg7uRYJFBnYMLti-nh.html&si=UodnBXB5Z9LhZNib) where we have covered different types of graph and we have included the concept of tracking visited nodes.
Well explained Bro.
Hey thanks for the basic covering, but I am wondering why you are not discussing which one to use, where to use and why to use ? Why are you not showcasing time complexity with each approach ? 🙂
Hello man, welcome to you.
I don't know why sound of GeeksforGeeks is too low as compared to other channel. I want to learn from you, but unable to hear properly
contents are awesome, but sound is very low
Dude you have got to say things for us beginners like:
What is this coding application you are using?
Where can I download it?
What extra add-ons were there if any?
Like I code on Visual Studio will this work there? Who knows? Maybe? Should I hand by hand type in everything you put since you didn't link scripts? No I won't
We are using Python in this particular video. But you can follow up with any language of your choice. If you are a beginner and want to follow line by line you can use any IDE be it your VS Code or our GFG online IDE (ide.geeksforgeeks.org/online-python3-compiler). Any compiler that supports python will be sufficient.