For Hobbyists & Makers · Network Centrality
Network Centrality for a spanning tree
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 spanning tree live below — adjust the inputs and watch it respond, right in your browser.
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.
Data Inspector
Metricbetweenness
Most centralD
Nodes7
Governing equation
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.
More with Network Centrality
Network Centrality for a road networkNetwork Centrality for a social graphNetwork Centrality for a subway mapNetwork Centrality for a supply networkNetwork Centrality for a flight networkNetwork Centrality for a power gridNetwork Centrality for a computer networkNetwork Centrality for a citation graph
Frequently asked questions
- Is this good for hobbyists & makers?
- Yes — this version of "Network Centrality for a spanning tree" 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.