Network Reliability for a subsidy
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 subsidy live below — adjust the inputs and watch it respond, right in your browser.
Controls
Presets
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.
Data Inspector
Governing equation
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
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.
Data Inspector
Governing equation
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
More with Network Reliability
Frequently asked questions
- Is this good for hobbyists & makers?
- Yes — this version of "Network Reliability for a subsidy" 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.