saadtaame / link-cut-tree Goto Github PK

According to you implementation, I believe that the returned value of function int depth(Node *x) is actually the weight of sub-tree rooted at x, i.e., the number of nodes who are descendant of x.
I don't think it's returning the depth of x in the tree.

Hi,

Thanks for providing reference code for implement link-cut trees.

I wrote a small program (below) on top of what you've provided and I find it seg faults for cutting. I've also attached the input file which results in this situation.

The first number on each line is either 0 (add) or 1 (remove). The next two numbers are two vertices: either we add an edge incident to them or remove the edge incident to them.
Some edges are added/removed multiple times, but the program detects this by checking the vertices' roots.

Do you know why this happens?
traffic_stream.txt
program.txt