Network Metrics.
Every network has a structure. Look beyond the drawing and see what connects it.
How connected is each node?
Number of incident edges per node. Weights do not affect degree.
Shortest distances from AWeighted distance table ↓
| Node | Degree | Distance | Reachable |
|---|
Keyboard controls & JSON format
All actions are available using Tab and Enter. Use the node/edge selector to inspect elements without a pointer. When the graph canvas is focused: + / − zoom, F fits the graph, arrow keys pan, and Delete removes the selected element in Playground. Use Step to advance the algorithm without animation.
JSON format: { "nodes": [{ "id": "A", "label": "A" }, { "id": "B", "label": "B" }], "edges": [{ "id": "e1", "source": "A", "target": "B", "weight": 2 }] }
Simple undirected graphs only. Maximum 150 nodes and 600 edges. Weights must be nonnegative finite numbers up to 1,000,000. Graph edits are saved in this browser when local storage is available. Import and export use local files; nothing is uploaded.