Breadth-First Search Visualized and Explained

This video should give you a quick overview of Breadh-First Search. Notes: - I say that the visited nodes are stored in another queue. In practice, you would use a list or a hash table. The animations are made with my tool Alvis. Play with the demo here https://alvis-algorithms.web.app/?a=bfs View the GitHub repository here https://github.com/carltheperson/alvis Feel free to leave a comment if you find a mistake. You can also open an issue on GitHub. Thanks for watching!