wdcxc的专栏

用最小生成树kruskal算法求最小建造长度#include<string.h> #include<iostream> #include<vector> #include<queue> #include<algorithm>using namespace std;struct edge{ int b, e, len; };struct cmpe{ bool operator()(ed

#include<iostream> #include<string.h> #include<vector> #include<utility> #include<cmath> #include<queue> #include<iomanip> using namespace std;struct cmpq{ bool operator()(pair<int,double> p1,pair<

#include<string.h> #include<iostream> #include<vector> #include<cmath> #include<algorithm> #include<string.h> #include<queue> #include<utility> using namespace std;struct edge{ int s, t; double