图的普里姆算法

作为一名合格的程序员,我们知道最基本的普里姆算法,图的普里姆算法是求最小生成树的一种算法,利用两个一维数组来实现.

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>

#define MAXPOINT  9
#define INFINITY  99
访问标志的数组 ,全部初始化0;
typedef struct Graph
{
	int point[MAXPOINT];    //顶点表
	int  arc[MAXPOINT][MAXPOINT];  //邻接矩阵
	int numPoint, numEdge;   //图当前的顶点数和边数
	int visited[MAXPOINT];

}Graph;
//无向网图的邻接矩阵表示
void CreateGraph(Graph* G)
{
	int i, j, k, w;
	for (int i = 0; i < MAXPOINT; i++)
		G->visited[i] = 0;
	printf("请输入顶点数和边数:\n");
	scanf("%d  %d", &G->numPoint, &G->numEdge);
	printf("请依次输入每个顶点:\n");
	for (i = 0; i < G->numPoint; i++)
	{
		scanf("%d", &G->point[i]);
	}
	for (i = 0; i < G->numPoint; i++)
	{
		for (j = 0; j < G->numPoint; j++)
		{
			if (i == j)
				G->arc[i][j] = 0;           //矩阵初始化
			else
				G->arc[i][j] = INFINITY;
		}
	}
	for (k = 0; k < G->numEdge; k++)   //读入numEdge条边
	{
		printf("请输入边(vi,vj)上的下标i,下标j和权w:\n");
		scanf("%d,%d,%d", &i, &j, &w);
		G->arc[i][j] = w;
		G->arc[j][i] = G->arc[i][j];   //无向图,矩阵对称.
	}
}

void MiniSpanTree_Prim(Graph *G)
{
	int min, i, j, k;
	int vex[MAXPOINT];   //生成树的纳入边的起点.
	int lowcost[MAXPOINT];
	lowcost[0] = 0;    //lowcost=0 表示此顶点在生成树里
	vex[0] = 0;
	for (i = 1; i < G->numPoint; i++)   //把第一行数据写进去.
	{
		lowcost[i] = G->arc[0][i];
		vex[i] = 0;
	}
	for (i = 1; i < G->numPoint; i++)  //构造最小生成树的过程.
	{
		min = INFINITY;
		j = 1; k = 0;
		while (j < G->numPoint)
		{
			if (lowcost[j]!=0&& lowcost[j] < min)
			{
				min = lowcost[j];
				k = j;
			}
			j++;
		}
		printf("(%d,%d)", vex[k], k);
		lowcost[k] = 0;
		for (j = 1; j < G->numPoint; j++)
		{
			if (lowcost[j] != 0 && G->arc[k][j] < lowcost[j])
			{
				lowcost[j] = G->arc[k][j];
				vex[j] = k;
			}
		}

	}

}


int main()
{
	Graph G;
	CreateGraph(&G);
	MiniSpanTree_Prim(&G);
	system("pause");
	return 0;
}