I - Agri-Net——最小生成树Prim算法

Think:
1知识点：最小生成树Prim算法
2题意：输入权值矩阵，求最小花费使得n个结点构成连通图

vjudge题目链接

以下为Accepted代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int inf = 0x3f3f3f3f;

int e[114][114], vis[114], dis[114];

void Prim(int n);

int main(){
    int n, i, j;
    while(~scanf("%d", &n)){
        for(i = 1; i <= n; i++){
            for(j = 1; j <= n; j++){
                scanf("%d", &e[i][j]);
            }
        }
        Prim(n);
    }
    return 0;
}
void Prim(int n){
    int i, miv, v, num, sum;
    memset(vis, 0, sizeof(vis));
    for(i = 1; i <= n; i++)
        dis[i] = e[1][i];
    vis[1] = 1, dis[1] = 0, num = 1, sum = 0;
    while(num < n){
        miv = inf;
        for(i = 1; i <= n; i++){
            if(!vis[i] && dis[i] < miv){
                miv = dis[i], v = i;
            }
        }
        vis[v] = 1, num++, sum += miv;
        for(i = 1; i <= n; i++){
            if(!vis[i] && e[v][i] < dis[i])
                dis[i] = e[v][i];
        }
    }
    printf("%d\n", sum);
}