GraphLab › Dijkstra's algorithm
Dijkstra's algorithm finds the shortest path from a start vertex to every other vertex in a weighted graph, as long as no edge has a negative weight. It is the idea behind route planning in maps and in computer networks.
Tap the start vertex, then the end vertex. Use Next to watch the distance table change one step at a time. Edit the graph or the edge weights and the result updates.