ShortPathCalculator.h

#pragma once
#include "defines.h"
#include "HungarianAlg/HungarianAlg.h"

///
/// \brief The SPSettings struct
///
struct SPSettings
{
    track_t m_distThres = 0.8f;
    size_t m_maxHistory = 10;
};

///
/// \brief The ShortPathCalculator class
///
class ShortPathCalculator
{
public:
    ShortPathCalculator(const SPSettings& settings)
        : m_settings(settings)
    {
    }
    virtual ~ShortPathCalculator() = default;

    virtual void Solve(const distMatrix_t& costMatrix, size_t N, size_t M, assignments_t& assignment, track_t maxCost) = 0;

protected:
    SPSettings m_settings;
};

///
/// \brief The SPHungrian class
///
class SPHungrian final : public ShortPathCalculator
{
public:
    SPHungrian(const SPSettings& settings)
        : ShortPathCalculator(settings)
    {
        //std::cout << "SPHungrian" << std::endl;
    }

    void Solve(const distMatrix_t& costMatrix, size_t colsTracks, size_t rowsRegions, assignments_t& assignmentT2R, track_t /*maxCost*/) override
    {
        //std::cout << "SPHungrian::Solve" << std::endl;
        m_solver.Solve(costMatrix, colsTracks, rowsRegions, assignmentT2R, AssignmentProblemSolver::optimal);
    }

private:
    AssignmentProblemSolver m_solver;
};

///
/// \brief The SPBipart class
///
class SPBipart final : public ShortPathCalculator
{
public:
    SPBipart(const SPSettings& settings)
        : ShortPathCalculator(settings)
    {
        //std::cout << "SPBipart" << std::endl;
    }

    void Solve(const distMatrix_t& costMatrix, size_t colsTracks, size_t rowsRegions, assignments_t& assignmentT2R, track_t maxCost) override;
};

///
/// \brief The SPLAPJV class
///
class SPLAPJV final : public ShortPathCalculator
{
public:
    SPLAPJV(const SPSettings& settings)
        : ShortPathCalculator(settings)
    {
        //std::cout << "SPLAPJV" << std::endl;
    }

    void Solve(const distMatrix_t& costMatrix, size_t colsTracks, size_t rowsRegions, assignments_t& assignmentT2R, track_t /*maxCost*/) override;
};