augmentable(int s, int t) {\rqueue<int> queue;\rmemset(prev, -1, sizeof(prev));.\rprev[s] = s;\rqueue.push(s);\rwhile (!queue.empty()) {\rint p = queue.front(), i;\rqueue.pop();\rfor (i = 0; i < size; i++) {\rif (cap[p][i] > 0 && prev[i] == -1) {\rprev[i] = p;\rif (i == t) return true;\relse queue.push(i);\rreturn false;\r)\rint maxFlow(int s, int t) {\rint flow = 0, i;\rwhile (augmentable(s, t)) {\rint extend = INF;\rfor (i = t; i != s; i = prev[i]) if(extend > cap[prev[i]][i]) extend =\rcap[prev.\rfor (i = t; i != s; i = prev[i]) {\rcap[prev[i]][i] -= extend;\rcap[i][prev[i]] += extend;\r)\rflow += extend;\r)\rreturn flow;\r)\rint main()\rreturn 0;
全文预览