仅做个人笔记

#include <cstdio> const int MAXN = 1000; const int INF = 1000000000; int n, G[MAXN][MAXN]; int d[MAXN]; //顶点到集合s的最短距离 bool vis[MAXN]; int prim() { //类似于Dijkstra fill(d, d + MAXN, INF); d[0] = ...

const int MAXN = 10000; struct edge { int u, v; //边的两个端点 int cast; //边权 } E[MAXN]; int father[N]; int findFather(int x) { int a = x; while(x != father[x]) { x = father[x]; } while(a != father[...