将所有边排序,从小到大枚举最小边,以这条边为开始找最小生成树(不一定包含所有点),根据find(a)和find(b)是否相等判断a到b是否有边,p[a]表示以a为起点指向能到达的点,即连通。
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#define LL long long
#define OJ_DEBUG 0
#define READ_FILE 1
using namespace std;
const int NN_MAX = 310;
const int MM_MAX = 100010;
const int INF = 0x1fffffff;
struct Edge{
int a,b,c;
Edge (int a1=0,int b1=0,int c1=0):a(a1),b(b1),c(c1){}
bool operator < (const Edge& chs) const {return c<chs.c;}
}theEdge[NN_MAX*NN_MAX];
/**********************************************************/
int lenEdge;
int p[NN_MAX];
/*********************************************************