摘要：
求解无向图的点连通度，转化为网络流详细的解释明天再写了#include <cstdio>#include <cstring>#include <queue>using namespace std;#define N 60#define min(a,b) a<b?a:b#define max(a,b) a>b?a:b#define INF 0x3f3f3f3fint first[10*N];struct edge{ int u,v,cap,flow,next;}e[N*N*N];int nume;int n,m;void EK(int s ,int 阅读全文
