利用Prim算法坐标上求最小生成树的权值

利用Prim算法坐标上求最小生成树的权值

#include<iostream>
using namespace std;
const int MaxSize=10;
const int Max=9999;

int abs(int a)
{
    if(a>0)return a;
    else return -a;
}

struct shortEdge
{
    int adjvex;
    int lowcost;
};

int MinEdge(shortEdge array[],int vertexNum)
{
    int k;
    int Min=9999;
    for(int i=0;i<vertexNum;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];
    int s1[MaxSize],s2[MaxSize];
public:
    MGraph(char a[],int n)