Is this good for hobbyists & makers?

Yes — this version of "Pipeline Network for a carbon footprint" 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.

For Hobbyists & Makers · Pipeline Network

Pipeline Network for a carbon footprint

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 carbon footprint live below — adjust the inputs and watch it respond, right in your browser.

Fluid

open full solver →

2D Fluid (CFD) StudioLive

Stam stable-fluids · Navier–Stokes

Controls

Speed1×

Click and drag on the canvas to inject dye and velocity.

Presets

Viscosity

Injection force

Dye amount

▶ Run in Python

Data Inspector

Grid96×96

Total dye0

Mean speed0.000

Max speed0.000

Enstrophy0.00e+0

Governing equation

\frac{\partial u}{\partial t} + (u \cdot \nabla) u = - \frac{\nabla p}{ρ} + 1.0 e - 7 \nabla^{2} u, \nabla \cdot u = 0

Reading this result: Near-zero viscosity: momentum barely dissipates, so vortices persist and the flow tips into turbulent, chaotic mixing.

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

↓

Shortest Path

open full solver →

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 Pipeline Network

Pipeline Network for a solar farm Pipeline Network for a wind turbine Pipeline Network for a home battery Pipeline Network for an EV charger Pipeline Network for a power grid Pipeline Network for a heat pump Pipeline Network for a gas turbine Pipeline Network for a hydro dam

Frequently asked questions

Is this good for hobbyists & makers?: Yes — this version of "Pipeline Network for a carbon footprint" 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.