eturn ans; } int id[MAXN][MAXN],vist[MAXN]; void bfs() { queue
q; int u,v; memset(vist,0,sizeof(vist)); vist[1]=1; q.push(1); while(!q.empty()) { u=q.front(); q.pop(); for(int i=head[u]; i!=-1; i=edg[i].next ){ v=edg[i].to; if(!vist[v]&&edg[i].cap-edg[i].flow>0) vist[v]=1,q.push(v); } } } int main() { int T,n,m,u,v,c; scanf(%d,&T); while(T--) { scanf(%d%d,&n,&m); init(); memset(id,-1,sizeof(id)); while(m--) { scanf(%d%d%d,&u,&v,&c); id[u][v]=eid; addEdg(u,v,c); } int ans=maxFlow_sap(1,n,n); bfs(); for(int i=2; i
ans)ans=tans; } printf(%d ,ans); } }
?
|