Do I need to install anything?

No. It runs in any modern browser, free, with no account required.

For Hobbyists & Makers · Shortest Path

Shortest Path for a dependency graph

Built for hobbyists & makers exploring it for fun. Play with real physics and math, no license and no setup — just open and tinker. Simulate a dependency graph live below — adjust the inputs and watch it respond, right in your browser.

Shortest Path (Dijkstra)Live

weighted graph search

Controls

Dijkstra's algorithm finds the shortest path from a source (A, blue) to every other node in a weighted graph, always expanding the closest unvisited node next. The number inside each node is its shortest distance from A; the green edges trace the optimal route to your chosen destination. It powers GPS routing, network protocols, and logistics. Click any node to re-target.

Size a graph for the exportable Python solver below — the diagram stays a fixed six-node example.

Presets

Nodes

Edge density

▶ Run in Python

Data Inspector

SourceA

DestinationF

Shortest distance11

Graph size6 nodes

Est. edges9 (60%)

Governing equation

d (v) = min (d (v), d (u) + w (u, v)), d (F) = 11

Reading this result: Dijkstra grows a set of finalized nodes, each step expanding the nearest unvisited one and relaxing its outgoing edges. Because all weights are non-negative, the first time a node is finalized its distance is already optimal. This configuration describes 6 nodes and about 9 weighted edges (density 60%).

Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.

or unlock everything with Pro →

Also for:Students Researchers Educators Engineers K-12 Students First Responders General version →

More with Shortest Path

Shortest Path for a road network Shortest Path for a social graph Shortest Path for a subway map Shortest Path for a supply network Shortest Path for a flight network Shortest Path for a power grid Shortest Path for a computer network Shortest Path for a citation graph

Frequently asked questions

Is this good for hobbyists & makers?: Yes — this version of "Shortest Path for a dependency graph" is framed for hobbyists & makers exploring it for fun. Play with real physics and math, no license and no setup — just open and tinker.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.