摘要： 割点代码:#include<iostream>#include<fstream>using namespace std;int n;struct e{ int data; e *next;};e edge[101];int v[101],dfn[101],low[101],index;void solve(int s){ int i,j,k; dfn[s]=low[s]=++index; e *p=edge[s].next; v[s]=0; while(p) { if(dfn[p->data]==0) { solve(p->data); if(low[p-& 阅读全文

摘要： 最小割代码：#include<iostream>#include<fstream>using namespace std;int n,m;int map[501][501];int v[501],com[501],w[501];int cost;int S,T;void search(){ int i,j,k; int maxx; memset(v,0,sizeof(v)); memset(w,0,sizeof(w)); S=T=-1; while(1) { maxx=-1;k=-1; for(i=0;i<n;i++) if(!com[i]&&!v 阅读全文