C
carmelo
hy guys, i'm trying to implement union-find operations with a forest,
each node has a pointer to its parent.. the classic implementation
that all books says it's better.. (f.e. http://en.wikipedia.org/wiki/Union_find
) i have a problem.. sometimes i need to split the structures made
with the unions and i need to count my unions.. anyione has an idea?
each node has a pointer to its parent.. the classic implementation
that all books says it's better.. (f.e. http://en.wikipedia.org/wiki/Union_find
) i have a problem.. sometimes i need to split the structures made
with the unions and i need to count my unions.. anyione has an idea?