【codeup墓地】1765: 算法7-9：最小生成树（prim、普里姆算法、克鲁斯卡尔算法、无向图）

原题链接

//普里姆算法

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;

const int MAX = 100, INF = (1<<30) - 1;

int N;
int G[MAX][MAX] = {0};
int d[MAX];
bool visited[MAX] = {0};
int sum = 0;

bool Prim(int s)
{
	fill(d, d+MAX, INF);
	d[s] = 0;
	for(int i=0; i<N; i++)
	{
		int u = -1, MIN = INF;
		for(int v=0; v<N; v++)
		{
			if(!visited[v] && d[v] < MIN)
			{
				MIN = d[v];
				u = v;
			}
		}
		if(u == -1) return false;
		sum += d[u];
		visited[u] = 1;
		for(int v=0; v<N; v++)
		{
			if(!visited[v] && G[u][v] && d[v] > G[u][v])
			{
				d[v] = G[u][v];
			}
		}
	}
	return true;
}

int main()
{
	scanf("%d", &N);
	for(int i=0; i<N; i++)
	{
		for(int j=0; j<N; j++)
		{
			scanf("%d", &G[i][j]);
		}
	}
	if(Prim(0))
	{
		printf("%d\n", sum);
	}
	return 0;
}

//克鲁斯卡尔算法

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;

const int MAX = 3000, INF = (1<<30) - 1;

typedef struct Edge
{
	int u, v;
	int weight;
}Edge;

int N, X, cnt = 0;
Edge E[MAX] = {0};
bool visited[MAX] = {0};
int father[MAX] = {0};
int sum = 0;

void init()
{
	for(int i=0; i<MAX; i++) father[i] = i;
}

int findFather(int a)
{
	int aF = a;
	while(aF != father[aF])
	{
		aF = father[aF];
	}
	while(a != aF)
	{
		int temp = father[a];
		father[a] = aF;
		a = temp;
	}
	return aF;
}

bool cmp(Edge A, Edge B)
{
	return A.weight < B.weight;
}

int main()
{
	init();
	scanf("%d", &N);
	for(int i=0; i<N; i++)
	{
		for(int j=0; j<N; j++)
		{
			scanf("%d", &X);
			if(X)
			{
				E[cnt].u = i;
				E[cnt].v = j;
				E[cnt].weight = X;
				cnt++;
			}
		}
	}
	sort(E, E+cnt, cmp);
	for(int i=0; i<cnt; i++)
	{
		int uF = findFather(E[i].u);
		int vF = findFather(E[i].v);
		if(uF != vF)
		{
			father[vF] = uF;
			sum += E[i].weight;
		}
	}
	printf("%d\n", sum);
	return 0;
}