diff options
| author | pjungeblut <paul.jungeblut@gmail.com> | 2014-10-25 17:43:08 +0200 |
|---|---|---|
| committer | pjungeblut <paul.jungeblut@gmail.com> | 2014-10-25 17:43:08 +0200 |
| commit | 04703be68216170849bfe5151319ec962d3d072b (patch) | |
| tree | 5d4d19966e89807e11be60a23a8e90b04da24463 /maxFlow/edmondsKarp.cpp | |
| parent | 44d45f9bccf4ae637cd20fa399aea7b20c63868a (diff) | |
adding closest pair algorithm
Diffstat (limited to 'maxFlow/edmondsKarp.cpp')
| -rw-r--r-- | maxFlow/edmondsKarp.cpp | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/maxFlow/edmondsKarp.cpp b/maxFlow/edmondsKarp.cpp index c82b141..a2be9a6 100644 --- a/maxFlow/edmondsKarp.cpp +++ b/maxFlow/edmondsKarp.cpp @@ -1,7 +1,7 @@ int s, t, f; //source, target, single flow -int res[100][100]; //adj-matrix +int res[MAX_V][MAX_V]; //adj-matrix vector< vector<int> > adjList; -int p[100]; //bfs spanning tree +int p[MAX_V]; //bfs spanning tree void augment(int v, int minEdge) { if (v == s) { f = minEdge; return; } @@ -10,12 +10,11 @@ void augment(int v, int minEdge) { res[p[v]][v] -= f; res[v][p[v]] += f; }} -int main() { - //inititalize res, adjList, s, t +int main() { //first inititalize res, adjList, s and t int mf = 0; while (true) { f = 0; - bitset<100> vis; vis[s] = true; + bitset<MAX_V> vis; vis[s] = true; queue<int> q; q.push(s); memset(p, -1, sizeof(p)); while (!q.empty()) { //BFS |