Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dijkstra's Algorithm - Coggle Diagram
Dijkstra's Algorithm
-
-
Intro
-
Then to a second nearest, and so on
Fringe
-
They are the candidates from which Dijkstra’s algorithm selects the next vertex nearest to the source.
Vertex
-
Add new u*
-
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), respectively.
-