|
1 | 1 | /* |
2 | | -Breadth-first approach can be applied to determine the shortest path between two nodes in an unweighted graph. It searches the target node among all neighbors of the starting node. Then the process is repeated on the level of the neighbors of the neighbors and so on. |
| 2 | +Breadth-first approach can be applied to determine the shortest path between two nodes |
| 3 | +in an equi-weighted graph. It searches the target node among all neighbors of the |
| 4 | +starting node, then the process is repeated on the level of the neighbors of the |
| 5 | +neighbors and so on. |
3 | 6 | (See also: https://en.wikipedia.org/wiki/Breadth-first_search ) |
4 | 7 | (see also: https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core ) |
5 | 8 | */ |
@@ -82,4 +85,4 @@ F --> G |
82 | 85 | console.log(breadthFirstShortestPath(graph, 'C', 'E')) |
83 | 86 | console.log(breadthFirstShortestPath(graph, 'E', 'B')) |
84 | 87 | console.log(breadthFirstShortestPath(graph, 'F', 'G')) |
85 | | -console.log(breadthFirstShortestPath(graph, 'A', 'G')) |
| 88 | +console.log(breadthFirstShortestPath(graph, 'A', 'G')) |
0 commit comments