diff options
| author | Paul Jungeblut <paul.jungeblut@gmail.com> | 2016-11-13 23:46:50 +0100 |
|---|---|---|
| committer | Paul Jungeblut <paul.jungeblut@gmail.com> | 2016-11-13 23:46:50 +0100 |
| commit | b209049ab3e8dde0f81074f7081ddaea57463417 (patch) | |
| tree | 51dd2f32b28950ed4b3a3472d473fbcdc7b0ae5f /graph/maxCarBiMatch.cpp | |
| parent | ec035ec7395db153834b8ba96b2ce54b597483b0 (diff) | |
Correcting small type in matching code.
Diffstat (limited to 'graph/maxCarBiMatch.cpp')
| -rw-r--r-- | graph/maxCarBiMatch.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/graph/maxCarBiMatch.cpp b/graph/maxCarBiMatch.cpp index 0bdfd80..761b536 100644 --- a/graph/maxCarBiMatch.cpp +++ b/graph/maxCarBiMatch.cpp @@ -17,7 +17,7 @@ int kuhn(int n) { // n = #Knoten links. int ans = 0; // Greedy Matching. Optionale Beschleunigung. for (int i = 0; i < n; i++) for (auto w : adjlist[i]) - if (pairs[w] == -1) pairs[i] = w; pairs[w] = i; ans++; break; } + if (pairs[w] == -1) { pairs[i] = w; pairs[w] = i; ans++; break; } for (int i = 0; i < n; i++) if (pairs[i] == -1) { visited.assign(n, false); ans += dfs(i); |