docs: protected int find( int child ) {
  		int root = graph.data[child];
  
  		if( root == graph.data[root] )
  			return root;
  
  		int inputChild = child;
  		while( root != child ) {
  			child = root;
  			root = graph.data[child];
  		}
  
  		graph.data[inputChild] = root;
  		return root;
  	}