Shortest-path problem: Dijkstra's algorithm
The algorithm of Dijkstra is used to compute the shortest path from a selected
node to all other nodes in a directed graph.
The graph may be constructed with the help of the graph
During the solution process the nodes for which the shortest distance is known
are marked yellow.
||index of nodes
node i to node j
||sets of tagged
from selected starting node to node i
of node i on the shortest path from the selected starting node to node i
- Domschke/Drexl (2005)