C语言实现最小生成树Prim算法 源码

测试用例：

1 2 34
1 3 46
1 6 19
2 5 12
3 6 25
3 4 17
4 6 25
4 5 38
5 6 26

答案：99

#include<stdio.h>
#include<stdlib.h>
#define INF 10000//无穷大
#define MAX_SIZE 100//数组容量
int dist[MAX_SIZE];//距离数组
int visited[MAX_SIZE];//访问数组 未访问0 已访问1
int sum;//距离和
struct Graph
{
	int vertex[MAX_SIZE];//顶点数组
	int arc[MAX_SIZE][MAX_SIZE];//边数组
	int vertexnum, arcnum;//顶点和边的个数
};
void GraphCreate(struct Graph* graph)//用邻接矩阵表示图，初始化和创建
{
	for (int i = 1; i <= graph->vertexnum; i++)//初始化
	{
		for (int j = 1; j <= graph->vertexnum; j++)
		{
			graph->arc[i][j] = INF;
		}
		dist[i] = INF;
		visited[i] = 0;
	}
	for (int i = 1; i <= graph->arcnum; i++)//创建
	{
		int a=0 , b=0 , w=0 ;//我有初始化的好习惯~~
		printf("请输入有边依附的两个顶点的编号以及权重：\n");
		scanf("%d%d%d", &a, &b, &w);
		graph->arc[a][b] = graph->arc[b][a] = w;//无向图记得要这样赋值，不然出大问题
	}
}
void Prim(struct Graph* graph)
{	
	visited[1] = 1;
	for (int i = 1; i <= graph->vertexnum; i++)
	{
		dist[i] = graph->arc[1][i];
	}
	for (int i = 1; i < graph->vertexnum; i++)
	{
		int min = INF;
		int pos = -1;
		for (int j = 1; j <= graph->vertexnum; j++)
		{
			if (!visited[j] && dist[j] < min)
			{
				min = dist[j];
				pos = j;
			}
		}
		printf("pos:%d\n", pos);
		visited[pos] = 1;
		sum += dist[pos];
		printf("%d\n", sum);//否则就输出结果res
		for (int j = 1; j <= graph->vertexnum; j++)
		{
			if(!visited[j]&&graph->arc[pos][j]<dist[j])
			dist[j] = graph->arc[pos][j];
		}
	}
	printf("最短距离：%d\n", sum);
}
int main()
{
	struct Graph graph;
	printf("请分别输入顶点和边的个数：\n");
	scanf("%d%d", &graph.vertexnum, &graph.arcnum);
	GraphCreate(&graph);
	Prim(&graph);
	return 0;
}