For Researchers · Spanning Tree
Spanning Tree for a delivery map
Built for researchers prototyping or validating an idea. Prototype fast, reproduce exactly, and share a citable, interactive version of your model. Simulate a delivery map live below — adjust the inputs and watch it respond, right in your browser.
Minimum Spanning TreeLive
Kruskal's algorithm
Controls
Presets
A minimum spanning tree connects every node with the least possible total edge weight and no cycles. Kruskal's algorithm sorts all edges and adds the cheapest that does not form a cycle, using a union-find structure to detect them. It designs efficient road, power, and network layouts that reach everywhere for the lowest cost.
Data Inspector
Nodes9
Tree edges8
Total weight0
Governing equation
Reading this result: A spanning tree over these 9 nodes always uses exactly 8 edges with no cycles — Kruskal keeps adding the cheapest edge that joins two separate groups until every node is connected.
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
More with Spanning Tree
Frequently asked questions
- Is this good for researchers?
- Yes — this version of "Spanning Tree for a delivery map" 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.