题目链接:
1.Prim算法
#include <bits/stdc++.h>
using namespace std;
struct edge{
int to, cost;
bool operator<(const edge& e) const {return cost>e.cost;}
};
const int maxn = 5005;
int n, m, cnt, ans; //点数,边数,经过点数量,总长度
vector<edge> g[maxn]; //存图
bool vis[maxn]; //是否走过该点
priority_queue<edge> q; //贪心选边
void prim(int u){
cnt++; vis[u] = 1;
for(auto e : g[u]) q.push({e});
while(q.size()){
auto e = q.top(); q.pop();
if(vis[e.to]) continue;
else {prim(e.to); ans+=e.cost; return;}
}
}
int main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>n>>m;
for(int i=1; i<=m; i++){
int x,y,z; cin>>x>>y>>z;
g[x].push_back({y,z});
g[y].push_back({x,z});
}
prim(1);
if(cnt==n) cout<<ans;
else cout<<"orz";
}
2.Kruskal算法
#include <bits/stdc++.h>
using namespace std;
struct edge{
int u, v, cost;
bool operator<(const edge& e)const {return cost<e.cost;}
} tmp;
const int maxn = 5005;
int n, m, cnt, ans, fa[maxn]; //点数,边数,树的边数量,总长度,根结点数组
vector<edge> g; //存图
int find(int x) {return fa[x]==x ? x : fa[x]=find(fa[x]);}
int main(){
// input
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin>>n>>m;
for(int i=1; i<=m; i++){
cin>>tmp.u>>tmp.v>>tmp.cost;
g.push_back(tmp);
}
// init
for(int i=1; i<=n; i++) fa[i] = i;
// work
sort(g.begin(), g.end());
for(auto e : g){
if(find(e.u) != find(e.v)){
cnt++; ans += e.cost;
fa[find(e.u)] = find(e.v);
}
}
if(cnt==n-1) cout<<ans;
else cout<<"orz";
}