摘要： 解法一：#includeusing namespace std;int map[102][102];int m=0xfffffff;void prim(int n){ int lowcost[102],s[102]={0},i,j,min,k,ans=0; for(i=1;i>map[i][j]; prim(n); } return 0;}解法二：#includeusing namespace std;const int Max = 102;const int inf = 0xfffffff;int n, ans;int map[Max][Max], dis[Max];//dis[i]表 阅读全文