summaryrefslogtreecommitdiff
path: root/graph/maxCarBiMatch.cpp
diff options
context:
space:
mode:
authorNoobie99 <noob999noob999@gmail.com>2023-08-29 09:40:24 +0200
committerNoobie99 <noob999noob999@gmail.com>2023-08-29 09:40:24 +0200
commit10df00ff808c6681c31ff115e53fcaafa17d96d1 (patch)
treec6b6a30144e4f16ef8b8af5cdaf6a4cc5bff20e1 /graph/maxCarBiMatch.cpp
parentbc7a54f2a10ff3bb76cf4920be53000264bad279 (diff)
small fix + consistency
Diffstat (limited to 'graph/maxCarBiMatch.cpp')
-rw-r--r--graph/maxCarBiMatch.cpp6
1 files changed, 3 insertions, 3 deletions
diff --git a/graph/maxCarBiMatch.cpp b/graph/maxCarBiMatch.cpp
index 0c5ac43..e928387 100644
--- a/graph/maxCarBiMatch.cpp
+++ b/graph/maxCarBiMatch.cpp
@@ -11,14 +11,14 @@ bool dfs(int v) {
return false;
}
-int kuhn(int n) { // n = #Knoten links.
+int kuhn(int l) { // l = #Knoten links.
pairs.assign(sz(adj), -1);
int ans = 0;
// Greedy Matching. Optionale Beschleunigung.
for (int v = 0; v < l; v++) for (int u : adj[v])
if (pairs[u] < 0) {pairs[u] = v; pairs[v] = u; ans++; break;}
- for (int v = 0; v < n; v++) if (pairs[v] < 0) {
- visited.assign(n, false);
+ for (int v = 0; v < l; v++) if (pairs[v] < 0) {
+ visited.assign(l, false);
ans += dfs(v);
}
return ans; // Größe des Matchings.