I am working on writing a fully retroactive DSU. And after reading a paper on how to built such a data structure, I stumbled upon Link Cut Trees.↵
↵
Can I make LCTs support path queries? Like minimum / maximum queries between 2 different vertices?↵
Also, what if I need to add an edge that creates a cycle in my tree, what can I do in this case?↵
↵
Any help would be greatly appreciated!
↵
Can I make LCTs support path queries? Like minimum / maximum queries between 2 different vertices?↵
Also, what if I need to add an edge that creates a cycle in my tree, what can I do in this case?↵
↵
Any help would be greatly appreciated!
