P206 例9-3 以如图9-10(a)所示的无向连通带权图为例测试上述普利姆函数的程序。设普利姆函数存放在文件Prim.h中，邻接矩阵存储结构定义及相应的图操作函数放在文件AdjMGraph.h中，

P206 例9-3 以如图9-10(a)所示的无向连通带权图为例测试上述普利姆函数的程序。设普利姆函数存放在文件Prim.h中，邻接矩阵存储结构定义及相应的图操作函数放在文件AdjMGraph.h中，图的创建函数存放在AdjMGraphCreate.h中。

头文件1：SeqList.h

#include<stdio.h>

#define MaxSize 100

typedef char DataType;

typedef struct
{
	DataType list[MaxSize];
	int size;
}SeqList;

void ListInitiate(SeqList *L)
{
	L->size=0;
}

int ListLength(SeqList L)
{
	return L.size;
}

int ListInsert(SeqList *L,int i, DataType x)
{
	int j;
	if(L->size>=MaxSize)
	{
		printf("数组已满无法插入!\n");
		return 0;
	}
	else if(i<0||i>L->size)
	{
		printf("参数i不合法！\n");
		return 0;
	}
	else
	{
		for(j=L->size;j>i;j--)
			L->list[j]=L->list[j-1];
		L->list[i]=x;
		L->size++;
		return 1;
	}
}

int ListDelete(SeqList *L,int i,DataType *x)
{
	int j;
	if(L->size<=0)
	{
		printf("顺序表已空无数据可删!\n");
		return 0;
	}
	else if(i<0||i>L->size-1)
	{
		printf("参数i不合法");
		return 0;
	}
	else
	{
		*x=L->list[i];
		for(j=i+1;j<=L->size-1;j++)
			L->list[j-1]=L->list[j];
		L->size--;
		return 1;
	}
}

int ListGet(SeqList L,int i,DataType *x)
{
	if(i<0||i>L.size-1)
	{
		printf("参数i不合法！\n");
		return 0;
	}
	else
	{
		*x=L.list[i];
		return 1;
	}
}

头文件2：AdjMGraph.h

#include"SeqList.h"

#define MaxVertices 10
#define MaxWeight 10000

typedef struct
{
	SeqList Vertices;
	int edge[MaxVertices][MaxVertices];
	int numOfEdges;
}AdjMGraph;

void Initiate(AdjMGraph *G,int n)
{
	int i,j;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(i==j)
				G->edge[i][j]=0;
			else
				G->edge[i][j]=MaxWeight;
		}
	}
		
	G->numOfEdges=0;
	ListInitiate(&G->Vertices);
}

void InsertVertex(AdjMGraph *G,DataType vertex)
{
	ListInsert(&G->Vertices,G->Vertices.size,vertex);
}

void InsertEdge(AdjMGraph *G,int v1,int v2,int weight)
{
	if(v1<0||v1>=G->Vertices.size||v2<0||v2>=G->Vertices.size)
	{
		printf("参数v1或v2越界出错!\n");
		return;
	}
	
	G->edge[v1][v2]=weight;
	G->numOfEdges++;
}

void DeleteEdge(AdjMGraph *G,int v1,int v2)
{
	if(v1<0||v1>=G->Vertices.size||v2<0||v2>=G->Vertices.size||v1==v2)
	{
		printf("参数v1或v2出错!\n");
		return;
	}
	
	if(G->edge[v1][v2]==MaxWeight||v1==v2)
	{
		printf("该边不存在!\n");
		return;
	}
	G->edge[v1][v2]=MaxWeight;
	G->numOfEdges--;
}

int GetFirstVex(AdjMGraph G,int v)
{
	int col;
	
	if(v<0||v>G.Vertices.size)
	{
		printf("参数v1越界出错!\n");
		return -1;
	}
	
	for(col=0;col<G.Vertices.size;col++)
	{
		if(G.edge[v][col]>0&&G.edge[v][col]<MaxWeight)
			return col;
	}
	return -1;
}

int GetNextVex(AdjMGraph G,int v1,int v2)
{
	int col;
	
	if(v1<0||v1>G.Vertices.size||v2<0||v2>G.Vertices.size)
	{
		printf("参数v1或v2越界出错!\n");
		return -1;
	}
	
	for(col=v2+1;col<G.Vertices.size;col++)
	{
		if(G.edge[v1][col]>0&&G.edge[v1][col]<MaxWeight)
			return col;
	}
	return -1;
}

头文件3：AdjMGraphCreate.h

#include"AdjMGraph.h"

typedef struct
{
	int row;
	int col;
	int weight;
}RowColWeight;

void CreatGraph(AdjMGraph *G,DataType V[],int n,RowColWeight E[],int e)
{
	int i,k;
	Initiate(G,n);
	for(i=0;i<n;i++)
		InsertVertex(G,V[i]);
		
	for(k=0;k<e;k++)
		InsertEdge(G,E[k].row,E[k].col,E[k].weight);
}

头文件4：Prim.h

#include<stdlib.h>
#include"AdjMGraphCreate.h"

typedef char VerT;

typedef struct
{
	VerT vertex;
	int weight;
}MinSpanTree;

void Prim(AdjMGraph G,MinSpanTree closeVertex[])
{
	VerT x;
	int n=G.Vertices.size,minCost;
	int *lowCost=(int *)malloc(sizeof(int)*n);
	int i,j,k;
	
	for(i=1;i<n;i++)
		lowCost[i]=G.edge[0][i];
		
	ListGet(G.Vertices,0,&x);
	closeVertex[0].vertex=x;
	lowCost[0]=-1;
	
	for(i=1;i<n;i++)
	{
		minCost=MaxWeight;
		for(j=1;j<n;j++)
		{
			if(lowCost[j]<minCost&&lowCost[j]>0)
			{
				minCost=lowCost[j];
				k=j;
			}
		}
	
		ListGet(G.Vertices,k,&x);
		closeVertex[i].vertex=x;
		closeVertex[i].weight=minCost;
		lowCost[k]=-1;
		for(j=1;j<n;j++)
		{
			if(G.edge[k][j]<lowCost[j])
				lowCost[j]=G.edge[k][j];
		}
	}
}

源文件：例9-3.c

#include<stdio.h>

#include"Prim.h" 

int main()
{
	AdjMGraph g;
	char a[]={'A','B','C','D','E','F','G'};
	RowColWeight rcw[]={{0,1,50},{1,0,50},{0,2,66},{2,0,60},{1,3,65},{3,1,65},{1,4,40},{4,1,40},{2,3,52},{3,2,52},{2,6,45},{6,2,45},{3,4,50},{4,3,50},{3,5,30},{5,3,30},{3,6,42},{6,3,42},{4,5,70},{5,4,70}};
	int n=7,e=20,i;
	MinSpanTree closeVertex[7];
	
	CreatGraph(&g,a,n,rcw,e);
	Prim(g,closeVertex);
	printf("初始结点=%c\n",closeVertex[0].vertex);
	for(i=1;i<n;i++)
	{
		printf("结点=%c 边的权值=%d\n",closeVertex[i].vertex,closeVertex[i].weight);
	}
	return 0;
}