/*项目名称：最小生成树普利姆算法（实验五）
姓名：常中平 071220141001*/
#include <iostream.h>
#include <fstream.h>
#include <Windows.h>
#define INFINITY 32768
#define MAX_VERTEX_NUM 20
typedef enum{DG,DN,UDG,UDN}GraphKind;
typedef struct ArcCell
{
int adj;
char *info;
}ArcCell,AdjMatrix[MAX_VERTEX_NUM ][MAX_VERTEX_NUM ];
typedef struct
{
char vexs[MAX_VERTEX_NUM];
AdjMatrix arcs;
int vexnum,arcnum;
GraphKind kind;
}MGraph;
//------------------------------------------------------------------
int LocateVex(MGraph G,char u)
{
for(int i=0;i<G.vexnum;i++)
{
if(G.vexs[i]==u)
break;
}
return i;
}
//-------------------------------------------------------------------
int CreateUDN(MGraph &G)
{
int r,s,w;
char v1,v2;
char u;
cout<<"输入顶点个数：";
cin>>G.vexnum;
cout<<"输入弧的个数:";
cin>>G.arcnum;
cout<<"输入顶点：";
for(int i=0;i<G.vexnum;++i)
{
cin>>u;
G.vexs[i]=u;
}
for(i=0;i<G.vexnum;++i)
{
for(int j=0;j<G.vexnum;++j)
{
G.arcs[i][j].adj=INFINITY;
G.arcs[i][j].info=NULL;
}
}
/*ifstream in("MGraph.txt",ios::in);
if(!in)
{
