Graphs/Shortest Path: Difference between revisions
From charlesreid1
(Created page with "=Notes= To find the shortest path from a vertex u to a vertex v, we can use a breadth-first search. See Graphs/BFS. =Flags= {{GraphsFlag}}") |
(→Notes) |
||
| Line 1: | Line 1: | ||
=Notes= | =Notes= | ||
To find the shortest path from a vertex u to a vertex v, we can use a breadth-first search. See [[Graphs/BFS]]. | To find the shortest path from a vertex u to a vertex v, we can use a breadth-first search. A BFS results in a BFS tree; if two vertices u and v are connected by the BFS, then the BFS tree yields the shortest path by definition. | ||
See [[Graphs/BFS]]. | |||
=Flags= | =Flags= | ||
{{GraphsFlag}} | {{GraphsFlag}} | ||
Revision as of 14:34, 9 September 2017
Notes
To find the shortest path from a vertex u to a vertex v, we can use a breadth-first search. A BFS results in a BFS tree; if two vertices u and v are connected by the BFS, then the BFS tree yields the shortest path by definition.
See Graphs/BFS.
Flags
