Edge aggregates for link-cut trees

Revision en2, by mayankp, 2016-11-26 22:07:51

How does one make a link-cut tree support finding the maximum (or anything else of the sort) along the edges of a vertex to the root? All implementations I have seen only support finding aggregates of vertices along such paths, and I think that simply having each vertex store the value of the edge from it to its parent doesn't work well when one links vertices which changes the parents of a bunch of vertices.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English mayankp 2016-11-26 22:07:51 0 (published)
en1 English mayankp 2016-11-26 22:07:15 446 Initial revision (saved to drafts)