Description: Problem Description: given the distance network between n cities in a region, the minimum spanning tree is established by prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated. Basi
Platform: |
Size: 237568 |
Author: Layman俗人 |
Hits: