prim算法c语言,Prim算法原理以及完整C代码实现

/* 求最小生成树的prim算法 */

#include

#include

#define MaxSize 20

#define MAX 10000

typedef char VertexType;

//定义图 的邻接矩阵表示法结构

typedef struct Graph {

VertexType ver[MaxSize+1];

int edg[MaxSize][MaxSize];

}Graph;

//邻接矩阵法图的生成函数

void CreateGraph( Graph *g )

{

int i = 0;

int j = 0;

int VertexNum;

VertexType Ver;

printf("请输入图的顶点:\n");

while( '\n' != (Ver=getchar()) )

g->ver[i++] = Ver;

g->ver[i] = '\0';

VertexNum = strlen(g->ver);

printf("请输入相应的的邻接矩阵:\n");

for( i=0; i

for( j=0; j

scanf("%d", &g->edg[i][j]);

}

//打印图的结点标识符和邻接矩阵

void PrintGraph( Graph g )

{

int i, j;

int VertexNum = strlen(g.ver);

printf("图的顶点为:\n");

for( i=0; i

printf("%c ", g.ver[i]);

printf("\n");

printf("图的邻接矩阵为:\n");

for( i=0; i

for( j=0; j

printf("%d ", g.edg[i][j]);

printf("\n");

}

}

//求图的顶点数

int CalVerNum( Graph g )

{

return strlen(g.ver);

}

//将不邻接的顶点之间的权值设置为MAX

void SetWeight( Graph *g )

{

for( int i=0; i

for( int j=0; j

if( 0 == g->edg[i][j] )

g->edg[i][j] = MAX;

}

//运用prim算法求最小生成树

void prim( Graph g, int VerNum, int *parent )

{

int i, j, k;

int lowcost[MaxSize];

int closest[MaxSize], used[MaxSize];

int min;

for( i=0; i

lowcost[i] = g.edg[0][i];

closest[i] = 0;

used[i] = 0;//used[i] == 0 表示i顶点在U中，反之，在V-U中。

parent[i] = -1;

}

used[0] = 1;//第一步将编号为0的顶点放入U中，也可以是其他顶点

for( i=0; i

j = 0;

min = MAX;

for( k=1; k

if( (0==used[k]) && (lowcost[k]

min = lowcost[k];

j = k;

}

parent[j] = closest[j];

used[j] = 1;//将j顶点加入U中

for( k=0; k

if( (0==used[k]) && (g.edg[k][j]

lowcost[k] = g.edg[k][j];

closest[k] = j;//closest数组保存的是U中到V-U中最小权值的顶点编号

}

}

}

//打印最小生成树的边和MST的权值

void PrintMST( Graph g, int *parent )

{

int VerNum = CalVerNum( g );

int weight = 0;

printf("MST的边为:\n");

for( int i=1; i

printf("%c--%c\n", g.ver[parent[i]], g.ver[i] );

weight+=g.edg[parent[i]][i];

}

printf("MST的权值为:%d\n", weight);

}

int main()

{

Graph g;

int parent[20];

CreateGraph ( &g );

PrintGraph( g );

SetWeight( &g );

prim( g, CalVerNum(g), parent );

PrintMST( g, parent );

return 0;

}