Please enable JavaScript.
Coggle requires JavaScript to display documents.
MM11 - Coggle Diagram
MM11
Dijkstra's Algorithm
Finds the shortest path from the source to a vertex nearest to it, then to a second nearest, and so on
these vertices, the source and the edges form a subtree Ti of the given graph
-
to identify the i-th nearest vertex, the algorithm computes, for every fringe vertex u, the sum of the distance to the nearest tree vertex v and the length dv from source to v, and then select the shortest of those sums
-
-
-
For each remaining fringe vertex u that is connected to u* by an edge of weight w(u*, u) such that du* + w(u*, u) < du, update the labels of u by u* and du* + w(u*, u)
-
-