summaryrefslogtreecommitdiff
path: root/graph/virtualTree.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-03-10 20:50:43 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-03-10 20:51:35 +0100
commit8bad05892517601c7161b34a5ab775290d254938 (patch)
treed22a161d17165cf0ff0beb8d9292f520d702136f /graph/virtualTree.cpp
parentcd870938f6cf266292e0e5cecb2d96d604b2ad9d (diff)
parentdb64838afe7f333d45f3c76c8e72aea89ccbf52a (diff)
Merge mzuenni changes
Diffstat (limited to 'graph/virtualTree.cpp')
-rw-r--r--graph/virtualTree.cpp25
1 files changed, 25 insertions, 0 deletions
diff --git a/graph/virtualTree.cpp b/graph/virtualTree.cpp
new file mode 100644
index 0000000..f7a3cb1
--- /dev/null
+++ b/graph/virtualTree.cpp
@@ -0,0 +1,25 @@
+// needs dfs in- and out- time and lca function
+vector<int> in, out;
+
+void virtualTree(const vector<int>& a) { // takes indices of used nodes
+ auto ind = a;
+ sort(all(ind), [&](int x, int y) {return in[x] < in[y];});
+
+ for (int i=0; i<sz(a)-1; i++) {
+ ind.push_back(lca(ind[i], ind[i+1]));
+ }
+ sort(all(ind), [&](int x, int y) {return in[x] < in[y];});
+ ind.erase(unique(all(ind)), ind.end());
+
+ int n = ind.size();
+ vector<vector<int>> tree(n);
+ stack<int> st{{0}};
+ for (int i=1; i<n; i++) {
+ while (in[ind[i]] >= out[ind[st.top()]]) st.pop();
+ tree[st.top()].push_back(i);
+ st.push(i);
+ }
+
+ // virtual directed tree with n nodes, original indices in ind
+ // weights can be calculated if necessary, e.g. with binary lifting
+}