pub fn find(&mut self, u: usize) -> usize {
        let pu = self.parent[u];
        if pu != u {
            self.parent[u] = self.find(pu);
        }
        self.parent[u]
    }
/// Finds the set's representative. Do path compression along the way to make
/// future queries faster.
Finds the set's representative. Do path compression along the way to make
future queries faster.
Finds the set ' s representative . Do path compression along the way to make future queries faster .
pub fn find(&mut self, u: usize) -> usize {
        let pu = self.parent[u];
        if pu != u {
            self.parent[u] = self.find(pu);
        }
        self.parent[u]
    }
pub fn find ( & mut self , u : usize ) -> usize { let pu = self . parent [ u ] ; if pu != u { self . parent [ u ] = self . find ( pu ) ; } self . parent [ u ] }
Finds the set's representative.
Finds the set ' s representative .
&mut self
u
usize
&mut self
u
usize