PPolySim OS
For Engineers · Shortest Path

Shortest Path for a pipeline network

Built for engineers using it for real design work. Go from concept to a running model in the browser, then scale to the cloud when needed. Simulate a pipeline network live below — adjust the inputs and watch it respond, right in your browser.

Shortest Path (Dijkstra)Live

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

▶ Run in Python

Data Inspector

SourceA
DestinationF
Shortest distance11
Graph size6 nodes
Est. edges9 (60%)

Governing equation

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 →

More with Shortest Path

Frequently asked questions

Is this good for engineers?
Yes — this version of "Shortest Path for a pipeline network" is framed for engineers using it for real design work. Go from concept to a running model in the browser, then scale to the cloud when needed.
Do I need to install anything?
No. It runs in any modern browser, free, with no account required.