Utilities/DisjointSets.h

Go to the documentation of this file.

/************************************************************************************
    Copyright (C) 2005-2008 Assefaw H. Gebremedhin, Arijit Tarafdar, Duc Nguyen,
    Alex Pothen

    This file is part of ColPack.

    ColPack is free software: you can redistribute it and/or modify
    it under the terms of the GNU Lesser General Public License as published
    by the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    ColPack is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public License
    along with ColPack.  If not, see <http://www.gnu.org/licenses/>.
************************************************************************************/

#ifndef DISJOINTSETS_H
#define DISJOINTSETS_H

using namespace std;

namespace ColPack
{
        class DisjointSets
        {
         private:
           
                vector<int> p_vi_Nodes;
           
         public:
            
                //Public Constructor 4251
                DisjointSets();

                //Public Constructor 4252
                DisjointSets(int);

                //Public Destructor 4253
                ~DisjointSets();

                //Public Function 4254
                int SetSize(int);
            
                //Public Function 4255
                int Count();
            
                //Public Function 4256
                int Print();

                //Public Function 4257
                int Find(int);

                //Public Function 4258
                int FindAndCompress(int);

                //Public Function 4259

                int Union(int li_SetOne, int li_SetTwo);

                //Public Function 4260

                int UnionByRank(int li_SetOne, int li_SetTwo);

                //Public Function 4261

                int UnionBySize(int li_SetOne, int li_SetTwo);
            
        };
}
#endif