Dynamic Graph queries?

Правка en2, от brokie, 2024-05-01 21:24:03

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!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский brokie 2024-05-01 21:24:03 34
en1 Английский brokie 2024-05-01 21:23:23 375 Initial revision (published)