Please enable JavaScript.
Coggle requires JavaScript to display documents.
IADs sem 2 - Coggle Diagram
IADs sem 2
Shortest Paths
-
-
-
Properties
For two vertices the shortest path's sub paths will be the shortest path between the vertices in the sub paths
The problem with negative weights is that if there is a negative weight cycle then the algorithm can get stuck in an infinite loop
-
-
-
-
-
-
Shortest Path Tree: a graph showing the shortest paths from a source vertice s to all other vertices
-
-
-
-