Prim算法

#include<iostream>//最小生成树Prim算法
using namespace std;
const int MaxSize=10;
const int Max=9999;

struct shortEdge
{
    int lowcost;
    int adjvex;
};

int MinEdge(struct shortEdge array[],int arcNum)
{
    int k;
    int Min=9999;
    for(int i=0;i<arcNum;i++)
    {
        if(array[i].lowcost!=0&&array[i].lowcost<Min)
        {
            Min=array[i].lowcost;
            k=i;
        }
    }
    return k;
}

class MGraph
{
private:
    int arcNum,vertexNum;
    int arc[MaxSize][MaxSize];
    char vertex[MaxSize];
public:
    MGraph(char a[],int n,int e)
    {
        arcNum=e;
        vertexNum=n;
        for(int i=0;i<vertexNum;i++)
        {
            vertex[i]=a[i];
        }

        for(int i=0;i<vertexNum;i++)
        {
            for(int j=0;j<vertexNum;j++)
            {
                if(i==j)arc[i][j]=0;
                else arc[i][j]=Max;
            }
        }

        int i,j,weight;
        for(int k=0;k<arcNum;k++)
        {
            cin>>i>>j>>weight;
            arc[i][j]=weight;
            arc[j][i]=weight;
        }
    }

    friend void Prim(MGraph G)
    {
        struct shortEdge array[MaxSize];
        int k;
        for(int i=1;i<G.vertexNum;i++)
        {
              array[i].lowcost=G.arc[0][i];
              array[i].adjvex=0;
        }

        array[0].lowcost=0;

        for(int i=1;i<G.vertexNum;i++)
        {
            k=MinEdge(array,G.vertexNum);
            cout<<"("<<k<<array[k].adjvex<<")"<<array[k].lowcost<<" ";

            array[k].lowcost=0;

            for(int j=1;j<G.vertexNum;j++)
            {
                if(G.arc[k][j]<array[j].lowcost)
                {
                    array[j].lowcost=G.arc[k][j];
                    array[j].adjvex=k;
                }
            }
        }
    }
};

int main()
{
    char T[MaxSize];
    cin>>T;
    int n,e;
    cin>>n>>e;
    MGraph a(T,n,e);
    Prim(a);
}
/*
abcdef
6 9
0 1 34
0 5 19
0 2 46
2 5 25
2 3 17
5 3 25
1 4 12
4 5 26
3 4 38
*/