Minimum Spanning Tree: Network Design

Place a scatter of sites in 3D space and watch two classic greedy algorithms — Prim's and Kruskal's — connect every one of them with the least possible total cable length, one edge at a time. This is the exact problem an engineer solves when routing fiber, power lines, or circuit-board traces between a fixed set of points: the minimum spanning tree connects everything with zero redundant links and provably minimal total cost. Toggle between the two algorithms to see how a tree that grows outward from one node (Prim's) compares edge-by-edge with one that is assembled globally from cheapest to most expensive link (Kruskal's), track the running cable length and the percentage saved versus wiring every possible pair directly, and reveal the full candidate graph to see just how sparse the final network really is.