08-图7 公路村村通 (30 分)
现有村落间道路的统计数据表中,列出了有可能建设成标准公路的若干条道路的成本,求使每个村落都有公路连通所需要的最低成本。
输入格式:
输入数据包括城镇数目正整数N(≤1000)和候选道路数目M(≤3N);随后的M行对应M条道路,每行给出3个正整数,分别是该条道路直接连通的两个城镇的编号以及该道路改建的预算成本。为简单起见,城镇从1到N编号。
输出格式:
输出村村通需要的最低成本。如果输入数据不足以保证畅通,则输出−1,表示需要建设更多公路。
输入样例:
6 15
1 2 5
1 3 3
1 4 7
1 5 4
1 6 2
2 3 4
2 4 6
2 5 2
2 6 6
3 4 6
3 5 1
3 6 1
4 5 10
4 6 8
5 6 3
输出样例:
12
使用prime算法+邻接表实现的最小生成树,在寻找最小权值边时用优先队列优化
#include <iostream>
#include <vector>
#include <queue>
const int maxn = 1001;
const int maxnum = 9e7;
using namespace std;
typedef struct edge {
int weight, dest;
struct edge *next;
edge(int w, int d, struct edge* n):weight(w), dest(d), next(n){}
}edge;
struct vertex {
// int index;
edge *first;
vertex():first(nullptr){}
}graph[maxn];
vector<int> dist(maxn, maxnum);
vector<bool> visited(maxn, false);
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int start, end, weight;
cin >> start >> end >> weight;
edge *e = new edge(weight, end, graph[start].first);
graph[start].first = e;
e = new edge(weight, start, graph[end].first);
graph[end].first = e;
}
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>>q;
//dist,index
q.push({0,1});
int last = 1;
int result = 0;
while (!q.empty()) {
pair<int,int>p = q.top();
q.pop();
if (visited[p.second])
continue;
result += p.first;
visited[p.second] = true;
dist[p.second] = 0;
last = p.second;
edge *temp = graph[last].first;
while (temp) {
if (!visited[temp->dest]) {
dist[temp->dest] = min(dist[temp->dest], temp->weight);
q.push({dist[temp->dest], temp->dest});
}
temp = temp->next;
}
}
for(int i = 1; i <= n; ++i)
if (dist[i]) {
cout << "-1" << endl;
return 0;
}
cout << result << endl;
return 0;
}
使用kruskal算法,只存一半的边就行
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1001;
const int maxnum = 9e7;
typedef struct edge {
int weight, start, end;
bool isvisited;
struct edge *next;
edge(int w, int s, int e, struct edge* n) :weight(w), start(s), end(e), next(n), isvisited(false){}
bool operator<(edge e)const {
return weight < e.weight;
}
bool operator>(edge e)const {
return weight > e.weight;
}
}edge;
struct vertex {
// int index;
edge *first;
vertex() :first(nullptr) {}
}graph[maxn];
vector<int>pre(maxn, -1);
void Adjust(int pos) {
int i = pos;
while (pre[pos] != pos)
pos = pre[pos];
//pos是最终的根结点
while (pre[i] != pos) {
int temp = pre[i];
pre[i] = pos;
i = temp;
}
return;
}
int main() {
int n, m;
cin >> n >> m;
//n个顶点,m条边;
priority_queue<edge, vector<edge>, greater<edge>>que;
for (int i = 1; i <= n; ++i) {
pre[i] = i;
}
//每个顶点的前驱结点开始时都是它本身
for (int i = 0; i < m; ++i) {
int start, end, weight;
cin >> start >> end >> weight;
edge *e = new edge(weight, start, end, graph[start].first);
graph[start].first = e;
que.push(*(e));
}
int num = 0, result = 0;
while (!que.empty()) {
edge e = que.top();
que.pop();
//选出一条权值最小的边,如果它没有被访问过,则看它的两个端点是否在一个集合当中
//如果不在,那么就将这两个顶点加入到一个集合当中
if (!e.isvisited) {
if (pre[e.start] != pre[e.end]) {
if (e.start < e.end)
pre[pre[e.end]] = pre[e.start];
else
pre[pre[e.start]] = pre[e.end];
result += e.weight;
for (int i = 1; i <= n; ++i)
Adjust(i);
//如果这条边的两个顶点在同一个集合当中,那么就永久忽略它
e.isvisited = true;
++num;
if (num == n - 1)
break;
}
}
}
if (num == n - 1)
cout << result << endl;
else
cout << "-1" << endl;
return 0;
}