摘要:
//Created by pritry int graph[MAX][MAX]; //原图 int source; //起点,这里为0 int sink; //终点,这里为n-1 int e[MAX]; //余流 int h[MAX]; //高度 int n; //顶点数 struct Lab... 阅读全文
摘要:
#include #include using namespace std; const int maxn=105; int DFN[105]; int low[105]; int stack[105]; int flag[105]; struct Edge{int u,v;}edge[maxn]; int head[maxn],cnt; inline void add(int u,int v)... 阅读全文