Method find

nodedb/src/engine/graph/algo/wcc.rs:71–78

Find the root of the set containing `x` with path compression.

(&mut self, mut x: usize)

    /// Find the root of the set containing `x` with path compression.
    fn find(&mut self, mut x: usize) -> usize {
        while self.parent[x] != x {
            // Path halving: point to grandparent.
            self.parent[x] = self.parent[self.parent[x]];
            x = self.parent[x];
        }
        x
    }

    /// Union the sets containing `a` and `b` by rank.
    fn union(&mut self, a: usize, b: usize) {