blob: dcfd85beb0bc7d66787c481013f69b935a379018 (
plain)
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
|
// Laufzeit: O(|V|*|E|^2)
int s, t, f; // Quelle, Senke, single flow
int res[MAX_V][MAX_V];
vector< vector<int> > adjlist;
int p[MAX_V];
void augment(int v, int minEdge) {
if (v == s) { f = minEdge; return; }
else if (p[v] != -1) {
augment(p[v], min(minEdge, res[p[v]][v]));
res[p[v]][v] -= f; res[v][p[v]] += f;
}}
// Initialisiere res, adjList, s und t.
int maxFlow() {
int mf = 0;
while (true) {
f = 0;
bitset<MAX_V> vis; vis[s] = true;
queue<int> q; q.push(s);
memset(p, -1, sizeof(p));
while (!q.empty()) { // BFS
int u = q.front(); q.pop();
if (u == t) break;
for (int j = 0; j < (int)adjlist[u].size(); j++) {
int v = adjlist[u][j];
if (res[u][v] > 0 && !vis[v]) {
vis[v] = true; q.push(v); p[v] = u;
}}}
augment(t, INF); // Pfad zu Fluss hinzufügen.
if (f == 0) break;
mf += f;
}
return mf;
}
|
