最小生成树（kruskal算法）

#include<iostream>

using   namespace   std;


//kruskal算法中对边集数组要求必须是根据全职升序排序的


typedef  char VertexType;
typedef  int EdgeType;

const  int   MAXVEX = 100;
const  int   MAXEDGE = 100;

typedef  struct  Edge
{
    int begin ,end;
    EdgeType weight;
}Edge;

typedef  struct  Graph//图
{
   VertexType  vexs[MAXVEX];
   Edge  edges[MAXEDGE];
   int numVertexes,numEdges;
}Graph;


//图->边集数组表示
void  CreateGraph(Graph * G)//这里没有区分有向，无向统一进行处理
{
    int i,j,k,w;
    cin>>G->numVertexes>>G->numEdges;
    for(i = 0;i < G->numVertexes;++i)//输入顶点
    {       
        cin>>G->vexs[i];
    }

    for(k = 0;k < G->numEdges;++k)//完成邻接矩阵的填写工作
    {
        cin>>i>>j>>w;
        G->edges[k].begin = i;
        G->edges[k].end = j;
        G->edges[k].weight = w;
    }
}

void  Show_Graph(Graph *G)//打印图的信息
{
    cout<<"图的顶点，边数为："<<G->numVertexes<<","<<G->numEdges<<endl;
    cout<<"边集数组为："<<endl;
    for(int i = 0;i < G->numEdges;++i)
    {
        cout<< G->edges[i].begin<<"->"<<G->edges[i].end<<"  ("<<G->edges[i].weight<<")"<<endl;
    }
}

int Find(int * parent,int f)
{
    while(parent[f])
    {
        f = parent[f];
    }
    return f;
}

void MiniSpanTree_kruskal(Graph *G)
{
    int i,n,m;
    int parent[MAXVEX];
    for(i = 0;i < G->numVertexes;++i)
    {
        parent[i] = 0;
    }
    for(i = 0;i < G->numEdges;++i)
    {
        n = Find(parent,G->edges[i].begin);
        m = Find(parent,G->edges[i].end);
        if(n != m)
        {
            parent[n] = m;
            printf("%d<->%d,W = %d  \n",G->edges[i].begin,G->edges[i].end,G->edges[i].weight);
        }
    }
}

int main()
{
    Graph *G = new Graph();
    CreateGraph(G);
    Show_Graph(G);
    delete G;
}