图——最小生成树prim算法（C语言实现）

#include<stdio.h>

#define VexType char 
#define MAX_COST 9999
#define MAXSIZE 100

typedef struct{
	int vexnum;
	int edgenum;
	VexType Vex[MAXSIZE];
	int Edge[MAXSIZE][MAXSIZE];
}Graph;
void InitGraph(Graph &G){
	G.vexnum= G.edgenum = 0;
	for(int i=0;i<MAXSIZE;i++){
		for(int j=0;j<MAXSIZE;j++){
			if(i == j)	G.Edge[i][j] = 0;
			else	G.Edge[i][j] = MAX_COST;
		}
	}
}
int LocateVex(Graph &G,VexType v){
	for(int i=0;i<G.vexnum;++i){
	if(G.Vex[i] == v)
		return i;
	}
	return -1;
}
void ShowGraph(Graph &G){
	int i,j;
	printf("邻接矩阵如下：\n");
	printf("    ");
	for(i=0;i<G.vexnum;i++){
		printf("%c\t",G.Vex[i]);
	}
	printf("\n");
	for(i=0;i<G.vexnum;i++){
		printf("%c   ",G.Vex[i]);
		for(j=0;j<G.vexnum;j++){
			if(G.Edge[i][j] == MAX_COST)	printf("∞\t");
			else printf("%d\t",G.Edge[i][j]);//打印0或1
		}
		printf("\n");
	}
	printf("\n");
}
void InsertVex(Graph &G,VexType v){
	if(G.vexnum>=MAXSIZE)return;
	G.Vex[G.vexnum++] = v;
}
void InsertEdge(Graph &G,VexType v1,VexType v2,int cost){
	int v1num = LocateVex(G,v1);
	int v2num = LocateVex(G,v2);
	if(v1num==-1||v2num==-1)return;
	G.Edge[v2num][v1num] = G.Edge[v1num][v2num] = cost;
	G.edgenum++;//边数+1
}
int GetWeight(Graph &G,int v1,int v2){
	if(v1 == -1 || v2 == -1)return MAX_COST;
	return G.Edge[v1][v2];
}
void MinSpanTree_Prim(Graph &G,VexType v){
	int i,j,min,min_index,begin,end,cost;
	int vnum = LocateVex(G,v);
	int mst[MAXSIZE];//mst = 最小花费路径的起始点标号
	int lowcost[MAXSIZE];//lowcost = 最小花费路径(如果为0则表示已经加入顶点)

	for(i = 0;i<G.vexnum;i++){
		if(i != vnum){
			lowcost[i] = GetWeight(G,vnum,i);
			mst[i] = vnum;//这些lowcost的起始点是v
		}
		else	lowcost[i] = 0;//把自己到自己的cost置成0
	}

	for(i = 0;i<G.vexnum-1;i++){
		min = MAX_COST;
		min_index = -1;//初始化

//循环找出lowcost和对应点的索引
		for(j = 0;j<G.vexnum;j++){
			if(lowcost[j] != 0 && lowcost[j]<min){
				min = lowcost[j];
				min_index = j;
			}
		}

		begin = mst[min_index];//起始点
		end = min_index;//终点
		printf("%c-->%c : %d\n",G.Vex[begin],G.Vex[end],min);
		lowcost[min_index] = 0;//选过了就把cost置成0


		for(j = 0;j<G.vexnum;j++){
			cost = GetWeight(G,min_index,j);
//如果以新入集合的点为起始点，cost值小于先前的lowcost，则更新
			if(cost<lowcost[j]){
				lowcost[j] = cost;
				mst[j] = min_index;
			}
		}
	}
}

int main(){
	Graph G;
	InitGraph(G);
	InsertVex(G,'A');
	InsertVex(G,'B');
	InsertVex(G,'C');
	InsertVex(G,'D');
	InsertVex(G,'E');
	InsertVex(G,'F');
	InsertEdge(G,'A','B',6);
	InsertEdge(G,'A','C',1);
	InsertEdge(G,'A','D',5);
	InsertEdge(G,'B','C',5);
	InsertEdge(G,'D','F',2);
	InsertEdge(G,'B','E',3);
	InsertEdge(G,'E','F',6);
	InsertEdge(G,'F','C',4);
	InsertEdge(G,'E','C',6);
	InsertEdge(G,'D','C',5);
	ShowGraph(G);
	MinSpanTree_Prim(G,'A');
	return 0;
}