diff options
| author | MZuenni <michi.zuendorf@gmail.com> | 2023-03-01 16:56:27 +0100 |
|---|---|---|
| committer | MZuenni <michi.zuendorf@gmail.com> | 2023-03-01 16:56:27 +0100 |
| commit | b15088d04aac27a3ef94cf79e68d681d735b1bbc (patch) | |
| tree | 96ba00e474790acd62d10a5d1ae5699e42cf6b4c /graph/connect.cpp | |
| parent | d8eefacaebee4e08aa92ae507d49079d90a93580 (diff) | |
reformatted empty lines
Diffstat (limited to 'graph/connect.cpp')
| -rw-r--r-- | graph/connect.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/graph/connect.cpp b/graph/connect.cpp index b25d844..a7b2811 100644 --- a/graph/connect.cpp +++ b/graph/connect.cpp @@ -2,13 +2,13 @@ struct connect { int n; vector<pair<int, int>> edges; LCT lct; // min LCT no updates required - + connect(int n, int m) : n(n), edges(m), lct(n+m) {} - + bool connected(int a, int b) { return lct.connected(&lct.nodes[a], &lct.nodes[b]); } - + void addEdge(int a, int b, int id) { lct.nodes[id + n] = LCT::Node(id + n, id + n); edges[id] = {a, b}; @@ -20,7 +20,7 @@ struct connect { lct.link(&lct.nodes[a], &lct.nodes[id + n]); lct.link(&lct.nodes[b], &lct.nodes[id + n]); }} - + void eraseEdge(ll id) { if (connected(edges[id].first, edges[id].second) && lct.query(&lct.nodes[edges[id].first], |