BipartiteGraphBicoloring/BipartiteGraphOrdering.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/>.
************************************************************************************/

//using namespace std;

#ifndef BIPARTITEGRAPHORDERING_H
#define BIPARTITEGRAPHORDERING_H

using namespace std;

namespace ColPack
{
        class BipartiteGraphOrdering : public BipartiteGraphVertexCover
        {
        public:

                int OrderVertices(string s_OrderingVariant);

        private:

                //Private Function 3401
                int CheckVertexOrdering(string s_VertexOrderingVariant);

        protected:

                double m_d_OrderingTime;

                string m_s_VertexOrderingVariant;

                vector<int> m_vi_OrderedVertices;

        public:

                //Public Constructor 3451
                BipartiteGraphOrdering();

                //Public Destructor 3452
                ~BipartiteGraphOrdering();

                //Virtual Function 3453
                virtual void Clear();

                //Virtual Function 3454
                virtual void Reset();

                //Public Function 3455
                int NaturalOrdering();
                int RandomOrdering();

                //Public Function 3456
                int LargestFirstOrdering();

                //Public Function 3457
                int SmallestLastOrdering();

                //Public Function 3458
                int IncidenceDegreeOrdering();

                //Public Function 3459
                int SelectiveLargestFirstOrdering();

                //Public Function 3460
                int SelectiveSmallestLastOrdering();

                //Public Function 3461
                int SelectiveIncidenceDegreeOrdering();

                //Public Function 3462
                int DynamicLargestFirstOrdering();

                //Public Function 3463
                string GetVertexOrderingVariant();

                //Public Function 3464
                void GetOrderedVertices(vector<int> &output);

                void PrintVertexOrdering();
                
                double GetVertexOrderingTime();
        };
}
#endif