Dijkstra Shortest Path Playground

Advance one settled vertex at a time. Edge weights are non-negative; the table shows each vertex's best-known distance from A.