diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 21:17:29 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 21:17:29 +0100 |
| commit | 1880ccb6d85c6eb79e724593457877bab431951c (patch) | |
| tree | 23eddd5bd0b29b3024e170a5ef9023eda9226ab5 /content/graph/euler.cpp | |
| parent | e95f59debd69ee7d45d5c966ce466d23264e1c3c (diff) | |
get rid of all() and sz()
Diffstat (limited to 'content/graph/euler.cpp')
| -rw-r--r-- | content/graph/euler.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/content/graph/euler.cpp b/content/graph/euler.cpp index a5ea192..c506d58 100644 --- a/content/graph/euler.cpp +++ b/content/graph/euler.cpp @@ -3,16 +3,16 @@ vector<int> to, validIdx, cycle; vector<bool> used; void addEdge(int u, int v) { - idx[u].push_back(sz(to)); + idx[u].push_back(ssize(to)); to.push_back(v); used.push_back(false); - idx[v].push_back(sz(to)); // für ungerichtet + idx[v].push_back(ssize(to)); // für ungerichtet to.push_back(u); used.push_back(false); } void euler(int v) { // init idx und validIdx - for (;validIdx[v] < sz(idx[v]); validIdx[v]++) { + for (;validIdx[v] < ssize(idx[v]); validIdx[v]++) { if (!used[idx[v][validIdx[v]]]) { int u = to[idx[v][validIdx[v]]]; used[idx[v][validIdx[v]]] = true; |
