Do I need to install anything?

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

For Researchers · Network Reliability

Network Reliability for a price war

Built for researchers prototyping or validating an idea. Prototype fast, reproduce exactly, and share a citable, interactive version of your model. Simulate a price war live below — adjust the inputs and watch it respond, right in your browser.

Max Flow

open full solver →

Maximum FlowLive

Edmonds-Karp network flow

Controls

Presets

Capacity S→A

Capacity B→D

The max-flow problem asks how much can be pushed from a source to a sink through a network of capacity-limited edges. Edmonds-Karp repeatedly finds an augmenting path and saturates it until none remain. By the max-flow min-cut theorem, the answer equals the capacity of the cheapest set of edges that, if cut, disconnects source from sink — the bottleneck.

▶ Run in Python

Data Inspector

Maximum flow18

Nodes6

Bottleneckmin cut

Governing equation

∣ f ∣ = v \sum f (s, v) = 18 = cut min c (S, T)

Reading this result: Both feed edges are generous, so the bottleneck has moved to the fixed interior capacities — adding more feed capacity no longer raises the max flow (min-cut theorem).

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

↓

Centrality

open full solver →

Network CentralityLive

who matters most

Controls

Centrality measures which nodes are most important in a network. Degree counts direct connections; betweenness counts how often a node lies on shortest paths (a bridge or broker); closeness measures how near a node is to all others. Switching metrics changes who matters — a key insight for social networks, infrastructure, and epidemiology.

▶ Run in Python

Data Inspector

Metricbetweenness

Most centralD

Nodes7

Governing equation

C_{B} (x) = s \neq = t \neq = x \sum \frac{σ _{s t} ( x )}{σ _{s t}}

Reading this result: By betweenness, node D is the key broker: it sits on the most shortest paths, so removing it would fracture the network even if it has few direct links.

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

or unlock everything with Pro →

Also for:Students Educators Engineers Hobbyists & Makers K-12 Students First Responders General version →

More with Network Reliability

Network Reliability for a supply-demand market Network Reliability for a monopoly Network Reliability for an auction Network Reliability for a tax policy Network Reliability for a trade tariff Network Reliability for an inflation model Network Reliability for a labor market Network Reliability for a game-theory standoff

Frequently asked questions

Is this good for researchers?: Yes — this version of "Network Reliability for a price war" is framed for researchers prototyping or validating an idea. Prototype fast, reproduce exactly, and share a citable, interactive version of your model.
Do I need to install anything?: No. It runs in any modern browser, free, with no account required.