代码1:http://blog.csdn.net/qq_34287501/article/details/52664138
模板2:
1.Dinic大牛板子
struct Edge{
int u, v, cap, flow, next;
}E[M];
struct Dinic{
int head[N], d[N];
int tot, sink, source;
void init() {
memset(head, -1, sizeof(head));
tot = 0;
}
inline void AddEdge(int u, int v, int cap) {
E[tot].u = u; E[tot].v = v; E[tot].cap = cap; E[tot].flow = 0; E[tot].next = head[u]; head[u] = tot++;
u = u ^ v; v = u ^ v; u = u ^ v;
E[tot].u = u; E[tot].v = v; E[tot].cap = 0; E[tot].flow = 0; E[tot].next = head[u]; head[u] = tot++;
}
inline bool bfs(int s) {
int u, v;
memset(d, 0, sizeof(d));
queue<int> Q;
Q.push(s);
d[s] = 1;
while (!Q.empty()) {
u = Q.front(); Q.pop();
if (u == sink) return true;
for (int i = head[u]; ~i; i = E[i].next) {
v = E[i].v;
if (!d[v] && E[i].cap - E[i].flow > 0) {
d[v] = d[u] + 1;
Q.push(v);
}
}
}
return false;
}
int dfs(int x, int a) {
if (x == sink || a == 0)
return a;
int f, flow = 0;
for (int i = head[x]; ~i; i = E[i].next) {
int v = E[i].v;
if (d[v] == d[x] + 1 && E[i].cap - E[i].flow > 0) {
f = dfs(v, min(a, E[i].cap - E[i].flow));
E[i].flow += f;
E[i^1].flow -= f;
flow += f;
a -= f;
if (!a) break;
}
}
if (flow == 0) d[x] = 0;
return flow;
}
int Maxflow(int source, int sink) {
int flow = 0;
this->sink = sink;
while (bfs(source)) flow += dfs(source, INF);
return flow;
}
};