diff options
| author | pjungeblut <paul.jungeblut@gmail.com> | 2014-12-26 14:11:53 +0100 |
|---|---|---|
| committer | pjungeblut <paul.jungeblut@gmail.com> | 2014-12-26 14:11:53 +0100 |
| commit | dd16f29ec2f1401b9d8bf930d6815d483f3ab315 (patch) | |
| tree | ec32cf80bcab76fd85c6306252702d33127e75d7 | |
| parent | f5ac7c6a80d70e17775eeab84bde199b47f2930d (diff) | |
adjList to adjlist
| -rw-r--r-- | graph/edmondsKarp.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/graph/edmondsKarp.cpp b/graph/edmondsKarp.cpp index 26c5b0d..9181062 100644 --- a/graph/edmondsKarp.cpp +++ b/graph/edmondsKarp.cpp @@ -1,6 +1,6 @@ int s, t, f; //source, target, single flow int res[MAX_V][MAX_V]; //adj-matrix -vector< vector<int> > adjList; +vector< vector<int> > adjlist; int p[MAX_V]; //bfs spanning tree void augment(int v, int minEdge) { @@ -20,8 +20,8 @@ int maxFlow() { //first inititalize res, adjList, s and t 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]; + 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; }}} @@ -31,4 +31,4 @@ int maxFlow() { //first inititalize res, adjList, s and t mf += f; } return mf; -}
\ No newline at end of file +} |
