BMatchingLibrary.h

/*
 * BMatchingSolver.h
 *
 * Default solver functions for BMatch library.
 *
 *  Created on: Dec 8, 2010
 *      Author: bert
 *
 *      A number of helper functions that construct the
 *      appropriate objects to solve b-matching and executes
 *      the solver using standard weight functions.
 *
 */


#ifndef BMATCHINGLIBRARY_H_
#define BMATCHINGLIBRARY_H_

#include "WeightOracle.h"
#include "SparseMatrix.h"
#include "BipartiteFunctionOracle.h"
#include "BipartiteMatrixOracle.h"
#include "FunctionOracle.h"
#include "MatrixOracle.h"
#include "EuclideanDistance.h"
#include "InnerProduct.h"
#include "BeliefPropagator.h"
#include "BMatchingProblem.h"

namespace bmatchingLibrary {

        //methods below return sparse ij objects

        SparseMatrix<bool> * bMatchBipartiteMatrixCache(int rows, int cols, double ** W, int * brows, int *bcols, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchBipartiteMatrixSparse(int rows, int cols, double ** W, int * brows, int *bcols, int maxIters);
        SparseMatrix<bool> * bMatchBipartiteMatrixSparse(int rows, int cols, double ** W, int * brows, int *bcols);
        bool ** bMatchBipartiteMatrix(int rows, int cols, double ** W, int * brows, int *bcols, int maxIters);
        bool ** bMatchBipartiteMatrix(int rows, int cols, double ** W, int * brows, int *bcols);

        SparseMatrix<bool> * bMatchBipartiteEuclideanCache(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchBipartiteEuclideanSparse(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int maxIters);
        SparseMatrix<bool> * bMatchBipartiteEuclideanSparse(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols);
        bool ** bMatchBipartiteEuclidean(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int maxIters);
        bool ** bMatchBipartiteEuclidean(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols);

        SparseMatrix<bool> * bMatchBipartiteInnerProductCache(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchBipartiteInnerProductSparse(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int maxIters);
        SparseMatrix<bool> * bMatchBipartiteInnerProductSparse(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols);
        bool ** bMatchBipartiteInnerProduct(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols, int maxIters);
        bool ** bMatchBipartiteInnerProduct(int rows, int cols, int d, double ** X, double ** Y, int * brows, int * bcols);

        SparseMatrix<bool> * bMatchMatrixCache(int size, double ** W, int * b, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchMatrixSparse(int size, double ** W, int * b, int maxIters);
        SparseMatrix<bool> * bMatchMatrixSparse(int size, double ** W, int * b);
        bool ** bMatchMatrix(int size, double ** W, int * b, int maxIters);
        bool ** bMatchMatrix(int size, double ** W, int * b);

        SparseMatrix<bool> * bMatchEuclideanCache(int size, int d, double ** X, int * b, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchEuclideanSparse(int size, int d, double ** X, int * b, int maxIters);
        SparseMatrix<bool> * bMatchEuclideanSparse(int size, int d, double ** X, int * b);
        bool ** bMatchEuclidean(int size, int d, double ** X, int * b, int maxIters);
        bool ** bMatchEuclidean(int size, int d, double ** X, int * b);

        SparseMatrix<bool> * bMatchInnerProductCache(int size, int d, double ** X, int * b, int cacheSize, int maxIters, bool verbose = false);
        SparseMatrix<bool> * bMatchInnerProductSparse(int size, int d, double ** X, int * b, int maxIters);
        SparseMatrix<bool> * bMatchInnerProductSparse(int size, int d, double ** X, int * b);
        bool ** bMatchInnerProduct(int size, int d, double ** X, int * b, int maxIters);
        bool ** bMatchInnerProduct(int size, int d, double ** X, int * b);


        // helper functions below

        SparseMatrix<bool> * solveBMatchingSparse(WeightOracle * wo, int * b, int maxIters, bool verbose = false);

        bool ** convertToBool(SparseMatrix<bool> * solution);

        int * cat(int * a, int * b, int aSize, int bSize);
}

#endif /* BMATCHINGLIBRARY_H_ */