Graphs/Breadth First Traversal: Difference between revisions
From charlesreid1
No edit summary |
|||
| Line 20: | Line 20: | ||
* [[Trees/Postorder]] | * [[Trees/Postorder]] | ||
* [[Trees/Inorder]] | * [[Trees/Inorder]] | ||
OOP design patterns: | |||
* [[Tree Traversal/Traversal Method Template]] | |||
[[:Category:Traversal]] | [[:Category:Traversal]] | ||
Revision as of 15:42, 7 September 2017
Also see BFS
Notes
What BFS Gets Us
Breadth-first search is important because it gets us the shortest path (the path with the fewest number of edges) from a vertex u to a vertex v. To state this more rigorously, a path in a breadth-first search tree rooted at vertex u to any other vertex v is guaranteed to be the shortest path from u to v (where shortest path denotes number of edges).
The fact that the BFS tree yields shortest paths is a natural consequence of how the BFS process works.
Related
Graphs:
Traversals on trees:
OOP design patterns:
Flags
