2.1 BFS: Breadth First Search Implementation in Python | Graph Data Structure

Breadth First Search Implementation in Python,
Finding shortest distance and path of any node from source node in a Graph.

BFS
BFS python

[ujjwalshrivastava]

loved those firecrackers after successfully implementing xd

[rickey]

finally found BFS implementation in python without OOPs. Grateful!✌

[avigeth]

I searched for lot of videos related to graph traversal implementation, most of them are of very long length and does not provide good python implementation.
You are so much clear and upto point.
Thanks for your efforts.

[shreyasr]

This basics explaination is what everyone need. Thanks for explaining so good in detail. Good job, keep continuing.

[hemantx]

best graph tutorial in python till now, really brother I have watched a lot of videos recently but you are the best one among them you should continue this series best wishes for your channel

[vijaykumarsingh]

best tutorial for graph till now in python love it bro make some more

[mustafahussain]

Sir Allah apko aur apke family ko mahfooz rakhay aur apko jannat mein jagah de. Inshallah

[tooniatoonia]

Nice explanation! What if the graph is given as an adjacency matrix instead?

[srishtipandey]

You explained it so well.. I never find graph so easy but you made it. Please provide linked list implement in python.

[marioedwin]

really helpful, thanks a lot.
i'm preparing for a coding interview where DS and algorithms plays a key role, so i look forward for more videos from u.

[abhishekjain]

bro, this code works perfectly fine for a non cyclic graph. But when it comes to cyclic, the visited vertex has one or more duplicates. Also can we apply bfs for cyclic graphs also.

[RAHULYADAV-ddyy]

Love your videos.. Keep making these type of vids..

[swatidas]

Best explanation video i came through...👍

[xlr]

Thank you sir. You explain very well, please make more videos on other topics in python.

[ramial-awad]

How would you print out the shortest path from all the nodes to A??

[minip]

Very informative... appreciate your Hard work... keep going and keep growing 👍👍👍

[arc]

thank you so much
Btw what software u use ?
I use vscode

[vaishnaviwaddepalli]

Best Video for BFS in python
Thank you!

[parsaf]

Can we use set() to represent the visited nodes? just thought that it will save space..

[shellysinha]

Write a function called searchBFS which given the tree or graph as defined below returns every number smaller than 4 in the order it was found using the breadth first technique.