最小生成树

#include <iostream.h>
#define MAX 30
typedef char VertexType;
typedef int vertex;
typedef struct
{
vertex adj;
}Arcell,AdjMatrix[MAX][MAX];
typedef struct
{
int vexnum,arcnum;
VertexType vexs[MAX];
AdjMatrix arc;
}MGraph;
typedef struct
{
VertexType adjvex;
int lowcost;
}closedge[MAX];
int Locate(MGraph G,char s)
{
int i;
for(i=0;i<G.vexnum;i++)
{
if(G.vexs[i]==s)
{
return i;
break;
}
}
return -1;
}
void Create(MGraph &G)
{
int i,m,n,t,j;
char a,b;
cout<<"please input the vex and arc of the graph:"<<endl;//输入节点的顶点数目和弧数
cin>>G.vexnum>>G.arcnum;
cout<<"please input the char of the graph:"<<endl;
for(i=0;i<G.vexnum;i++)
{
for(j=0;j<G.vexnum;j++)
G.arc[i][j].adj=100;//为了方便后面的计算，我们将这里的值赋值为100
}
for(i=0;i<G.vexnum;i++)
{
cin>>G.vexs[i];//输入每个节点所带的数据
}
for(i=0;i<G.arcnum;i++)
{
cout<<"please input the arc of the graph <vi-vj>:";//输入弧
cin>>a>>b>>t;
m=Locate(G,a);
n=Locate(G,b);
G.arc[m][n].adj=G.arc[n][m].adj=t;
}
for(i=0;i<G.vexnum;i++)
{
cout<<"和顶点"<<G.vexs[i]<<"相邻的节点有：";
for(j=0;j<G.vexnum;j++)
{
if(G.arc[i][j].adj<50)
cout<<G.vexs[j]<<"  ";
}
cout<<endl;
}
}
void MiniSpan(MGraph G,char u)
{
int i,j,k;
closedge close;
k=Locate(G,u);
for(j=0;j<G.vexnum;j++)
{
if(j!=k)
{
close[j].adjvex=u;
close[j].lowcost=G.arc[k][j].adj;//开始的赋值
}
}
close[k].lowcost=0;
for(i=1;i<G.vexnum;i++)
{
k=0;
for(j=0;j<G.vexnum;j++)
{
if(close[j].lowcost!=0)
{
k=j;
break;
}
}
for(j=1;j<G.vexnum;j++)
{
if(close[j].lowcost < close[k].lowcost && close[j].lowcost !=0 )
k = j;
}
cout<<close[k].adjvex<<G.vexs[k]<<endl;
close[k].lowcost=0;
for(j=0;j<G.vexnum;j++)
{
if(G.arc[k][j].adj<close[j].lowcost)
{
close[j].adjvex=G.vexs[k];
close[j].lowcost=G.arc[k][j].adj;
}
}
}
}
int main()
{
char s;
MGraph G;
Create(G);
cout<<"please input the start node:";
cin>>s;
MiniSpan(G,s);
return 0;
}