Hi guys Can someone please give me a good resource of how to solve dynamic graph connectivity and dynamic lca using treaps or how to implement link cut trees using treaps .. i can not find any good resources for that. thanks in advance guys.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
3 | maomao90 | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Hi guys Can someone please give me a good resource of how to solve dynamic graph connectivity and dynamic lca using treaps or how to implement link cut trees using treaps .. i can not find any good resources for that. thanks in advance guys.
Name |
---|
Auto comment: topic has been updated by AzorAhai (previous revision, new revision, compare).
I just googled 'link cut tree' and the 3-rd link was a full paper by authors XD.
Well, from my expirience, start from link cut, cause full dina-conn has MUCH more complicated concept/implementation.
Btw u can just ask this guy Darooha directly, its Daniel Sleator, the one who invented Splay-trees and had done a lot of work in link-cut trees.
(Hint: u can use treaps instead of splay and get O(log^2) instead of O(Log) per query, but Darooha's papers use Splay)
P.S. Englando is dead