Connecting Towns Using Kruskal's Algorithm
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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.
Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA
"Connecting Towns Using Kruskal's Algorithm"
Wolfram Demonstrations Project
Published: March 7 2011