Prime算法(加注释)

源代码地址:
https://blog.csdn.net/qq_43656233/article/details/103186367?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522165042075716780271555741%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=165042075716780271555741&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2_allbaidu_landing_v2~default-1-103186367.142^v9control,157^v4new_style&utm_term=prime%E7%AE%97%E6%B3%95c%2B%2B&spm=1018.2226.3001.4187

轻微改动+加了注释:

#include<iostream>
using namespace std;
const int MaxSize = 20;
const int INF = 2147483647;
int visited[MaxSize];
int lowcost[MaxSize];//用来表示（V-U）中的各个顶点与集合（U）中的顶点最短边的权值
int adjvex[MaxSize];//用来保存集合（U-V）中的顶点与集合（U）中连接的最小边的顶点。
 
int arc[MaxSize][MaxSize];//存储边信息 
int vertex[MaxSize]; //存储点信息 
int arcNum;//边的数目 
int vertexNum;//顶点的数目 

int MinEdge(int a[], int n)//MinEdge是用来算出lowcost数组中最小值的 i 点，也就是顶点
{
	int min = INF;
	int k = 0;
	for (int i = 1; i <= n; ++i)
	{
		if (min > a[i] && a[i] != 0)
		{
			min = a[i];
			k = i;
		}
	}
	return k;
}



	void MGraph(int a[], int n, int e)//图数组存储，邻接矩阵 
	{
		arcNum = e;
		vertexNum = n;
		for (int i = 1; i <= vertexNum; ++i)
		{
			vertex[i] = a[i];//顶点数组存放进去  1 2 3 4 5 6... 
		}
		
		for (int i = 1; i <= vertexNum; ++i) //把边都初始化为INF 
		{
			for (int j = 1; j <= vertexNum; ++j)
			{
				arc[i][j] = INF;
			}
		}
		
		
		for (int i = 1; i <= arcNum; ++i)//把存在的边信息输入 
		{
			int a, b, v;
			cin >> a >> b >> v;
			arc[a][b] = arc[b][a] = v;
		}
	}
	
	
	void Prime()  //普利姆算法实现 
	{
		for (int i = 2; i <= vertexNum; ++i)//初始化lowcost数组和adjvex全部设置为1 
		{
			lowcost[i] = arc[1][i];
			adjvex[i] = 1;
		}
		
		lowcost[1] = 0;//设置起点 
		for (int i = 2; i <= vertexNum; ++i)
		{
			int k = MinEdge(lowcost, vertexNum);//MinEdge是用来算出lowcost数组中最小值的 i 点，也就是顶点
			cout <<  adjvex[k] << "--->" << k << "  " << lowcost[k] << endl;  
			lowcost[k] = 0;//将k顶点加入u集合(原来的全部顶点是V集合) 
			
			for (int j = 1; j <= vertexNum; ++j)//加入了一个顶点后，所有的lowcost和adjvex都有可能发生相应的变化
			{
				if (arc[k][j] < lowcost[j])//将k加入u数组后，压迫更新lowcost数组和adjvex数组 
				{
					lowcost[j] = arc[k][j];
					adjvex[j] = k;
				}
			}
		}
	}

int main()
{
	int a[MaxSize];
	for (int i = 1; i < MaxSize; ++i)//初始化a[]数组，1 2 3 4 -----20 
	{
		a[i] = i;
	}
	int x, y;//输入顶点数目  边的数目 
	cin >> x >> y;
	MGraph(a, x, y);
	Prime();
	return 0;
}