Vanderbei’s applications · Princeton University
Shortest Paths
Build a directed network, assign travel times, and step through Dijkstra’s algorithm to find paths toward node a.
Network
Loading the Python engine…
Distances to a
| Node | Travel time | Next node | State |
|---|
As in the Java app, the search only settles distances below the sum of all arc times.