Download to read offline
BFS algorithms BFS algorithms BFS algorithms
- 1.
- 2. 2 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s
- 3. 3 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: s 2 Top of queue 3 1 1
- 4. 4 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: s 2 3 Top of queue 5 1 1 1
- 5. 5 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 2 3 5 Top of queue 1 1 1
- 6. 6 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 2 3 5 Top of queue 4 1 1 1 2
- 7. 7 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 2 3 5 4 Top of queue 1 1 1 2 5 already discovered: don't enqueue
- 8. 8 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 2 3 5 4 Top of queue 1 1 1 2
- 9. 9 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 3 5 4 Top of queue 1 1 1 2
- 10. 10 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 3 5 4 Top of queue 1 1 1 2 6 2
- 11. 11 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 3 5 4 6 Top of queue 1 1 1 2 2
- 12. 12 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 5 4 6 Top of queue 1 1 1 2 2
- 13. 13 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 5 4 6 Top of queue 1 1 1 2 2
- 14. 14 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 4 6 Top of queue 1 1 1 2 2
- 15. 15 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 4 6 Top of queue 1 1 1 2 2 8 3
- 16. 16 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 4 6 8 Top of queue 1 1 1 2 2 3
- 17. 17 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 6 8 Top of queue 1 1 1 2 2 3 7 3
- 18. 18 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 6 8 7 Top of queue 1 1 1 2 2 3 9 3 3
- 19. 19 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 6 8 7 9 Top of queue 1 1 1 2 2 3 3 3
- 20. 20 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 8 7 9 Top of queue 1 1 1 2 2 3 3 3
- 21. 21 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 7 9 Top of queue 1 1 1 2 2 3 3 3
- 22. 22 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 7 9 Top of queue 1 1 1 2 2 3 3 3
- 23. 23 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 7 9 Top of queue 1 1 1 2 2 3 3 3
- 24. 24 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 7 9 Top of queue 1 1 1 2 2 3 3 3
- 25. 25 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 9 Top of queue 1 1 1 2 2 3 3 3
- 26. 26 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 9 Top of queue 1 1 1 2 2 3 3 3
- 27. 27 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: 9 Top of queue 1 1 1 2 2 3 3 3
- 28. 28 Breadth First Search s 2 5 4 7 8 36 9 0 Undiscovered Discovered Finished Queue: Top of queue 1 1 1 2 2 3 3 3
- 29. 29 Breadth First Search s 2 5 4 7 8 36 9 0 Level Graph 1 1 1 2 2 3 3 3