Please enable JavaScript.
Coggle requires JavaScript to display documents.
M13 - Coggle Diagram
M13
-
Optimal Sorting
-
-
-
Application to shortest path finding
The topological ordering can also be used to quickly compute shortest paths through a weighted directed acyclic graph. Let V be the list of vertices in such a graph, in topological order. Then the following algorithm computes the shortest path from some source vertex s to all other vertices
-
-
