View the model
Download the model
Given a set of cities or nodes and the distance between each pair,
find the shortest total distance of links on the network to connect
all the nodes. There will be exactly one path between any two nodes.
This is the classic minimal spanning tree (MST) problem;