fig08_15.cpp

经典书籍源代码啊。。。第三版。。。数据结构与算法分析——C++描述(第3版).

/**
 * Perform a find with path compression.
 * Error checks omitted again for simplicity.
 * Return the set containing x.
 */
int DisjSets::find( int x )
{
    if( s[ x ] < 0 )
        return x;
    else
        return s[ x ] = find( s[ x ] );
}