最小生成树.docx

// : 定义控制台应用程序的入口点。
//
#include ""
int _tmain(int argc, _TCHAR* argv[])
{
return 0;
}
#eight;
[vb][va]=weight;
}
}
int main()
{
int u;
MGraph G;
printf("\tWelcom to use this program!\n");
printf("Building Undugraph:\n");
CreatUDN(G);
printf("Please Input the Start Point:");
scanf("%d",&u);
PRIM(G,u);
return 0;
}
/*
# include <iostream>
# include <cmath>
# include <vector>
# define INFINITY 10000
# define MAX_VERTEX_NUM 20
using namespace std;
struct T{
int adjvex;
int lowcost;
} closedge[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
{
int vexs[MAX_VERTEX_NUM];
AdjMatrix arcs;
int vexnum,arcnum;
GraphKind kind;
}MGraph;
int Location(MGraph G,int x)
{
for(int i=0;i<;i++)
if([i]==x)
{
return i;
break;
}
}
void CreateUDN(MGraph &G)
{
int IncInfo,v1,v2,w,i,j;
cout<<"input ,:"<<endl;
cin>>>>;
cout<<"\ninput []"<<endl;
for(i=0;i<;++i)
cin>>[i];
for(i=0;i<;++i)
for(j=0;j<;++j)
{
[i][j].adj=0;
[i][j].info=NULL;
}
cout<<"input 输入一条边依附的顶点:\n";
for(int