summaryrefslogtreecommitdiff
path: root/content/graph/euler.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
commit98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch)
tree5113d5cc24d1ad5f93810b6442ce584a36950dc8 /content/graph/euler.cpp
parentad3856a6b766087df0036de0b556f4700a6498c9 (diff)
parent8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff)
mzuenni tests
Diffstat (limited to 'content/graph/euler.cpp')
-rw-r--r--content/graph/euler.cpp23
1 files changed, 23 insertions, 0 deletions
diff --git a/content/graph/euler.cpp b/content/graph/euler.cpp
new file mode 100644
index 0000000..a5ea192
--- /dev/null
+++ b/content/graph/euler.cpp
@@ -0,0 +1,23 @@
+vector<vector<int>> idx;
+vector<int> to, validIdx, cycle;
+vector<bool> used;
+
+void addEdge(int u, int v) {
+ idx[u].push_back(sz(to));
+ to.push_back(v);
+ used.push_back(false);
+ idx[v].push_back(sz(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]++) {
+ if (!used[idx[v][validIdx[v]]]) {
+ int u = to[idx[v][validIdx[v]]];
+ used[idx[v][validIdx[v]]] = true;
+ used[idx[v][validIdx[v]] ^ 1] = true; // für ungerichtet
+ euler(u);
+ }}
+ cycle.push_back(v); // Zyklus in umgekehrter Reihenfolge.
+}