摘要： prim算法求最小生成树中的最大边测试数据：20 03 4317 419 418 581 14 01 22 23 24 23 05 139 1010 10100 1065 5100 1004 43 32 21 151 22 13 24 15 23999 9991 13 30结果Scenario #1Frog Distance = 5.000Scenario #2Frog Distance = 1.414Scenario #3Frog Distance = 1.414Scenario #4Frog Distance = 1.000Scenario #5Frog Distance = 134.35 阅读全文