What is the Network Reliability multi-solver?

Network Reliability is a guided workflow that chains 2 individual PolySim solvers into one end-to-end analysis, piping each result into the next step.

Yes. Every step runs entirely in your browser using real numerics — no install, no account, no cloud cost. Custom or private solver packs are available as a paid service.

Operations & Economics Pack · Multi-Solver

Network Reliability

Max-flow & redundancy. This multi-solver chains 2 solvers into a single guided workflow — run each step in order and carry the result forward.

Workflow steps

max-flow
→centrality

or unlock everything with Pro →

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.

Need a private, branded version?

We build custom solvers and workflows for labs, firms, agencies, and courses — your parameters, your branding, your data.

Explore Custom Solver Sets →

More in the Operations & Economics pack

Supply-Chain Optimizer Facility Location Project Portfolio Market Equilibrium Lab Auction Designer Pricing Strategy Traffic Flow Planner Inventory & Demand

Frequently asked questions

What is the Network Reliability multi-solver?: Network Reliability is a guided workflow that chains 2 individual PolySim solvers into one end-to-end analysis, piping each result into the next step.
Is it free to use?: Yes. Every step runs entirely in your browser using real numerics — no install, no account, no cloud cost. Custom or private solver packs are available as a paid service.