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

Network editing and search

Click a node, then click another node or an empty spot to connect them. Drag to move a node.

Tentative arcFinal tree arc

Random network
Travel times

Loading the Python engine…