(1.10)--最小生成树——普里姆算法.docVIP

#includestdio.h

#defineOK1

#defineERROR0

#defineMax_Int32767

#defineMVNum100

typedefintStatus;

typedefcharVerTexType;

typedefintArcType;

struct{

VerTexTypeadjvex;

ArcTypelowcost;

}closedge[MVNum];

typedefstruct{

VerTexTypevex[MVNum];

ArcTypearc[MVNum][MVNum];

intvexnum,arcnum;

}AMGraph;

intLocateVex(AMGraph*G,VerTexTypev)

{

inti;

for(i=0;iG-vexnum;i++)

{

if(G-vex[i]==v)

returni;

}

return-1;

}

StatusCreateUDN(AMGraph*G)

{

inti,j,k;

VerTexTypev1,v2;

ArcTypew;

printf(输入总节点数和总边数：);

scanf(%d%d,G-vexnum,G-arcnum);

fflush(stdin);

printf(输入各个节点的值：);

for(i=0;iG-vexnum;i++)

scanf(%c,G-vex[i]);

for(i=0;iG-vexnum;i++)

for(j=0;jG-vexnum;j++)

{

G-arc[i][j]=Max_Int;

}

for(k=0;kG-arcnum;k++)

{

fflush(stdin);

printf(输入一条边的两个顶点以及该边的权值：);

scanf(%c%c%d,v1,v2,w);

i=LocateVex(G,v1);

j=LocateVex(G,v2);

G-arc[i][j]=w;

G-arc[j][i]=G-arc[i][j];

}

returnOK;

}

intMin(AMGraphG)

{

inti;

intmin=Max_Int;

intindex=-1;

for(i=0;iG.vexnum;i++)

{

if(minclosedge[i].lowcostclosedge[i].lowcost!=0)

{

min=closedge[i].lowcost;

index=i;

}

}

returnindex;

}

voidMinSpanTree_Prim(AMGraphG,VerTexTypev)

{

inti,j,k;

VerTexTypeu0,v0;

k=LocateVex(G,v);

for(j=0;jG.vexnum;j++)

{

if(j!=k)

{

closedge[j].adjvex=v;

closedge[j].lowcost=G.arc[k][j];

}

}

closedge[k].lowcost=0;

for(i=1;iG.vexnum;i++)

{

k=Min(G);

u0=G.vex[k];

v0=closedge[k].adjvex;

printf(%c-%c\n,v0,u0);

closedge[k].lowcost=0;

for(j=0;jG.vexnum;j++)

{

if(closedge[j].lowcostG.arc[k][j])

{

closedge[j].adjvex=G.vex[k];

closedge[j].lowcost=G.arc[k][j];

}

}

}

}

intmain(void)

{

AMGraphG;

CreateUDN(G);

printf(普里姆算法生成的最小生成树边序列为：\n);

MinSpanTree_Prim(G,1);

printf(\n);

return0;

}