WOLFRAM|DEMONSTRATIONS PROJECT

Connecting Towns Using Kruskal's Algorithm

​
number of points
20
A government wants to construct a road network connecting many towns. Suppose each road must connect two towns and be straight. Kruskal's algorithm gives the least expensive tree of roads. Allowing nodes that are not towns leads to a different problem involving soap bubble theory.