Today I am going over Breadth First Search or BFS. I was unable to find a tutorial on BFS that included a queue trace, so I decided to make one myself. If you have and questions on BFS or other graph traversal algorithms, leave them in the comments below! Thanks!
Check out my tutorial on DFS:
Wikipedia on BFS:
https://en.wikipedia.org/wiki/Breadth-first_search
More on Graphs:
https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
▶️ Watch on DTube
▶️ Watch Source (IPFS)