Connecting Towns Using Kruskal's Algorithm

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.



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.