June 22nd, 2015

Alpine

(no subject)

Given a triangular lattice which has had a number of nodes selected, is there a good algorithm for determining the minimum spanning tree which connects all the selected nodes? Or is this something which needs to be brute forced?