Angoel (angoel) wrote,
Angoel
angoel

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?
Subscribe
  • Post a new comment

    Error

    Anonymous comments are disabled in this journal

    default userpic
  • 4 comments