weixin_44552961的博客

图的存储 邻接矩阵存储 const int maxn = 1e5+5; int e[maxn][maxn]; 邻接表存储 const int maxn = 1e5 + 5; struct Edge { int u, v, w; }; vector<Edge> G[maxn]; void addEdge(int u, int v, int w) { G[u].push_back({...

const int maxn = 1e5 + 5; int par[maxn], rnk[maxn]; int find(int x) { if (par[x] == x)return x; else return par[x]=find(par[x]); } bool unit(int x,int y) { int px = find(x); int py = find(y); if ...