《挑战程序设计竞赛》最小生成树（邻接矩阵实现）

思路都写在注释里了，说白了就是不断更新，利用染色来实现避圈法

#include <iostream>
using namespace std;
#define MAX 100
#define BLACK 1
#define WHITE -1
#define GRAY 0
#define NO -1

constexpr auto INF = 1<<21;;
int AM[MAX][MAX];//邻接矩阵
int n;
int p[MAX];//生成树的父节点
int d[MAX];//到每一个点的最短路径
int color[MAX];

int prim()
{
	int ans=0;//SPT的最短距离
	for (int i = 0; i < n; i++)//将每一个父节点设置为NO,最短路径长为无穷大，颜色为白（未扫描过）
	{
		p[i] = NO;
		d[i] = INF;
		color[i] = WHITE;
	}
	d[0] = 0;//首先加入第一个节点，所以花销d[0]为0
	while(1)//反复扫描
	{
		int mincost = INF;
		int u;
		for (int i = 0; i < n; i++)
		{
			if (color[i] != BLACK && d[i] < mincost)
			{
				mincost = d[i];
				u = i;
			}
		}
		if (mincost==INF)
		{
			break;
		}
		color[u] = BLACK;
		for (int i = 0; i < n; i++)
		{
			if (color[i] != BLACK && AM[u][i] != INF && AM[u][i] < d[i])
			{
				d[i] = AM[u][i];
				color[i] = GRAY;
				p[i] = u;
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		if (p[i] != NO)
		{
			ans += AM[i][p[i]];
		}
	}
	return ans;
}

int main()
{
	cin >> n;//初始化节点的个数
	for (int i = 0; i < n; i++)//初始化邻接矩阵
	{
		for (int j = 0; j < n; j++)
		{
			int e;
			cin >> e;
			AM[i][j] = (e == -1) ? INF : e;
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cout << AM[i][j]<<" ";
		}
		cout << endl;

	}
	cout << "\n"<<prim()<<endl;
	system("pause");
	return 0;
}