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 that must be visited. There may be additional nodes
that may be optionally visited.
There will be exactly one path between any two "must be visited" nodes.
This includes the classic minimal spanning tree (MST) problem;