15.7-1 prim

#include <cstdio>
#include <cstring>
#include <iostream>
#include <malloc.h>
using namespace std;

const int maxn = 117;
typedef struct GNode{
    int arc[maxn][maxn];
    int nv, ne;
}*MGraph;
struct{
    int adv; //Ｕ中到当前元素顶点最近的点的名称
    int low; //Ｕ中点到当前元素顶点的最小代价
}closedge[maxn];
int visit[maxn];

void CreateGraph(MGraph &G, int n)
{   //构造一个测试用的无向图
    int a, b, w, f;
    G->nv = n;
    G->ne = G->nv*(G->nv-1)/2;
    for(int i = 1; i <= G->ne; i++){
        cin>>a>>b>>w>>f;
        if(!f){
            G->arc[a][b] = w; G->arc[b][a] = w;}
    }
}
int minnum(int n)
{
    int minn, pos;
    minn = 1000, pos = 1;
    for(int i = 1; i <= n; i++)
        if(!visit[i] && closedge[i].low < minn){
            minn = closedge[i].low; pos = i;}
    return pos;
}
int MST_Prim(MGraph G, int n)//
{//从u出发求网G的最小生成树,输出各边
    int k = 1, ans = 0;
    closedge[k].low = 0; //将u并入U,赋0
    visit[1] = 1;
//    for(int i = 1; i <= G->nv; i++){
//        for(int j = 1; j <= G->nv; j++)
//            cout<<G->arc[i][j]<<" ";
//        cout<<endl;}
//    cout<<endl;
    for(int i = 1; i <= G->nv; ++i) //据u更新数组元素代价
        if(i != k){
            closedge[i].adv = k;
            closedge[i].low = G->arc[k][i];}
//    for(int i = 1; i <= G->nv; ++i)
//        cout<<closedge[i].low<<" ";
//    cout<<endl;
    for(int i = 1; i < G->nv; ++i){  //共n-1轮,每轮找最小边输出,赋0更新
        k = minnum(n);//代价非零的元素中找最小元素,返下标
        ans += closedge[k].low;
//        cout<<k<<" "<<ans<<endl;
        visit[k] = 1;
        closedge[k].low = 0;  //将k号结点并入U，赋0
        for(int j = 1; j <= G->nv; ++j)//据k号结点更新数组元素代价
            if(!visit[j] && G->arc[k][j] < closedge[j].low){
                closedge[j].adv = k;
                closedge[j].low = G->arc[k][j];}
//        for(int i = 1; i <= G->nv; ++i)
//            cout<<closedge[i].low<<" ";
//        cout<<endl;
    }
    return ans;
}

int main()
{
    int n;
    MGraph G;
    cin>>n;
    G = (MGraph)malloc(sizeof(struct GNode));//先开辟储存空间！！！！
    memset(closedge, 0, sizeof(closedge));
    memset(visit, 0, sizeof(visit));
    memset(G->arc, 0, sizeof(G->arc));
    CreateGraph(G, n);
    cout<<MST_Prim(G, n);
}