summaryrefslogtreecommitdiff
path: root/content/graph/hopcroftKarp.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 21:17:29 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 21:17:29 +0100
commit1880ccb6d85c6eb79e724593457877bab431951c (patch)
tree23eddd5bd0b29b3024e170a5ef9023eda9226ab5 /content/graph/hopcroftKarp.cpp
parente95f59debd69ee7d45d5c966ce466d23264e1c3c (diff)
get rid of all() and sz()
Diffstat (limited to 'content/graph/hopcroftKarp.cpp')
-rw-r--r--content/graph/hopcroftKarp.cpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/content/graph/hopcroftKarp.cpp b/content/graph/hopcroftKarp.cpp
index 7c0fec5..d07bd3a 100644
--- a/content/graph/hopcroftKarp.cpp
+++ b/content/graph/hopcroftKarp.cpp
@@ -21,7 +21,7 @@ bool bfs(int l) {
}
bool dfs(int v) {
- for (; ptr[v] < sz(adj[v]); ptr[v]++) {
+ for (; ptr[v] < ssize(adj[v]); ptr[v]++) {
int u = adj[v][ptr[v]];
if (pairs[u] < 0 ||
(dist[pairs[u]] > dist[v] && dfs(pairs[u]))) {
@@ -33,7 +33,7 @@ bool dfs(int v) {
int hopcroft_karp(int l) { // l = #Knoten links
int ans = 0;
- pairs.assign(sz(adj), -1);
+ pairs.assign(ssize(adj), -1);
dist.resize(l);
// Greedy Matching, optionale Beschleunigung.
for (int v = 0; v < l; v++) for (int u : adj[v])