forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaxFlow.cpp
More file actions
37 lines (35 loc) · 1002 Bytes
/
MaxFlow.cpp
File metadata and controls
37 lines (35 loc) · 1002 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#define REP(i,n) for(int i=0;i<(n);++i)
#define MAXN 205
#define INF 2000000000
int max_flow(int n, int mat[][MAXN], int source, int sink) {
int cap[MAXN], vis[MAXN], pre[MAXN];
int ret = 0;
while (true) {
memset(cap, 0, sizeof(cap));
memset(vis, 0, sizeof(vis));
cap[source] = INF;
int mx, idx;
while (true) {
mx = 0, idx = -1;
REP(i,n) {
if (!vis[i] && cap[i] > mx) mx = cap[i], idx = i;
}
if (idx == -1) return ret;
if (idx == sink) break;
vis[idx] = 1;
REP(i,n) {
if (cap[i] < min(mm[idx][i], mx)) {
cap[i] = min(mm[idx][i], mx);
pre[i] = idx;
}
}
}
mx = cap[sink];
for (int i = sink; i != source; i = pre[i]) {
int t = pre[i];
mm[t][i] -= mx, mm[i][t] += mx;
}
ret += mx;
}
return ret;
}