1 / 30

Exploring Undirected Graphs with Breadth-First Search: A Comprehensive Example

This guide delves into the implementation of the Breadth-First Search (BFS) algorithm for undirected graphs. It outlines the process of discovering nodes while traversing a graph, utilizing a queue-based approach to manage the frontier of the search. We walk through the BFS steps, detailing how nodes are visited, how to maintain a record of discovered and undiscovered nodes, and how to handle various scenarios like revisiting or completing the search. This comprehensive overview aims to enhance your understanding of graph traversal techniques.

darius-pope
Télécharger la présentation

Exploring Undirected Graphs with Breadth-First Search: A Comprehensive Example

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Undirected Breadth First Search A H B C G D E F

  2. Undirected Breadth First Search 0 A distance from A H visit(A) B C G D E F get Undiscovered Queue: A Fringe Active Finished

  3. Undirected Breadth First Search F 1 0 A H F discovered B C G D E F Undiscovered Queue: Fringe Active Finished

  4. Undirected Breadth First Search B 1 0 A H B discovered B C G D E F 1 Undiscovered Queue: F Fringe Active Finished

  5. Undirected Breadth First Search C 1 0 A H C discovered B C G 1 D E F 1 Undiscovered Queue: F B Fringe Active Finished

  6. Undirected Breadth First Search 1 G 0 A H G discovered B C G 1 1 D E F 1 Undiscovered Queue: F B C Fringe Active Finished

  7. Undirected Breadth First Search 0 A H 1 A finished B C G 1 1 D E F 1 get Undiscovered Queue: F B C G Fringe Active Finished

  8. Undirected Breadth First Search 0 A H 1 A alreadyvisited B C G 1 1 D E F 1 Undiscovered Queue: B C G Fringe Active Finished

  9. Undirected Breadth First Search D 2 0 A H 1 D discovered B C G 1 1 D E F 1 Undiscovered Queue: B C G Fringe Active Finished

  10. Undirected Breadth First Search 2 E 0 A H 1 E discovered B C G 1 1 D E 2 F 1 Undiscovered Queue: B C G D Fringe Active Finished

  11. Undirected Breadth First Search 0 A H 1 F finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: B C G D E Fringe Active Finished

  12. Undirected Breadth First Search 0 A H 1 B C G 1 1 2 D E 2 F 1 Undiscovered Queue: C G D E Fringe Active Finished

  13. Undirected Breadth First Search 0 A H 1 A alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: C G D E Fringe Active Finished

  14. Undirected Breadth First Search 0 A H 1 B finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: C G D E Fringe Active Finished

  15. Undirected Breadth First Search 0 A H 1 A alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: G D E Fringe Active Finished

  16. Undirected Breadth First Search 0 A H 1 C finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: G D E Fringe Active Finished

  17. Undirected Breadth First Search 0 A H 1 A alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: D E Fringe Active Finished

  18. Undirected Breadth First Search 0 A H 1 E alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: D E Fringe Active Finished

  19. Undirected Breadth First Search 0 A H 1 G finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: D E Fringe Active Finished

  20. Undirected Breadth First Search 0 A H 1 E alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: E Fringe Active Finished

  21. Undirected Breadth First Search 0 A H 1 F alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: E Fringe Active Finished

  22. Undirected Breadth First Search 0 A H 1 D finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: E Fringe Active Finished

  23. Undirected Breadth First Search 0 A H 1 D alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: Fringe Active Finished

  24. Undirected Breadth First Search 0 A H 1 F alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: Fringe Active Finished

  25. Undirected Breadth First Search 0 A H 1 G alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: Fringe Active Finished

  26. Undirected Breadth First Search H 3 0 A H 1 H discovered B C G 1 1 2 D E 2 F 1 Undiscovered Queue: Fringe Active Finished

  27. Undirected Breadth First Search 0 A H 3 1 E finished B C G 1 1 2 D E 2 F 1 get Undiscovered Queue: H Fringe Active Finished

  28. Undirected Breadth First Search 0 A H 3 1 E alreadyvisited B C G 1 1 2 D E 2 F 1 Undiscovered Queue: Fringe Active Finished

  29. Undirected Breadth First Search 0 A H 3 1 H finished B C G 1 1 2 D E 2 F 1 STOP Undiscovered Queue: Fringe Active Finished

  30. Undirected Breadth First Search 0 A distance from A H 3 1 B C G 1 1 2 D E 2 F 1

More Related