Introduction - If you have any usage issues, please Google them yourself
Given a distance network between n cities in a region, a minimum spanning tree is constructed by using Prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated.