hungarian.h

Go to the documentation of this file.

/********************************************************************
 ********************************************************************
 ** C++ class implementation of the Hungarian algorithm by David Schwarz, 2012
 **
 **
 ** O(n^3) implementation derived from libhungarian by Cyrill Stachniss, 2004
 **
 **
 ** Solving the Minimum Assignment Problem using the 
 ** Hungarian Method.
 **
 ** ** This file may be freely copied and distributed! **
 **
 **
 ** This file 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.  
 **
 ********************************************************************
 ********************************************************************/
#ifndef HUNGARIAN_H
#define HUNGARIAN_H

#include <iostream>
#include <vector>

using std::vector;

typedef enum {
        HUNGARIAN_MODE_MINIMIZE_COST,
        HUNGARIAN_MODE_MAXIMIZE_UTIL,
} MODE;

typedef enum {
        HUNGARIAN_NOT_ASSIGNED,
        HUNGARIAN_ASSIGNED,
} ASSIGN;


class Hungarian
{

public:
        Hungarian();
        Hungarian(const vector<vector<int> >&, int, int, MODE);

        int init(const vector<vector<int> >& input_matrix, 
                           int rows, 
                           int cols, 
                           MODE mode);

        bool solve();

        int cost() const;

        const vector<vector<int> >& assignment() const;

        void print_assignment();

        void print_cost();

        void print_status();

protected:
        bool check_solution(const vector<int>& row_dec, const vector<int>& col_inc, const vector<int>& col_vertex);
        bool assign_solution(const vector<int>& row_dec, const vector<int>& col_inc, const vector<int>& col_vertex);

private:

        int m_cost;
        int m_rows;
        int m_cols;
        vector<vector<int> > m_costmatrix;
        vector<vector<int> > m_assignment;   

};

#endif