dijkstras algorithm

Input interpretation

Dijkstra's algorithm

Definition

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path tree from the initial vertex to every other vertex in the graph. The algorithm is implemented in the Wolfram Language as FindShortestPath[g, Method -> "Dijkstra"].
More information »

Related terms

all-pairs shortest path | Bellman-Ford algorithm | Floyd-Warshall algorithm | graph distance | graph geodesic | reaching algorithm | shortest path | shortest path problem
POWERED BY THE WOLFRAM LANGUAGE