Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA > Class Template Reference

Functor wrapper for minimum-cost general matching. More...

#include <Min_Cost_Matching.H>

Public Member Functions

 Compute_Minimum_Cost_General_Matching (Cost cost=Cost(), SA sa=SA(), const bool max_cardinality=false)
 
Min_Cost_Matching_Result< long longoperator() (const GT &g, DynDlist< typename GT::Arc * > &matching)
 

Private Attributes

Cost cost_
 
SA sa_
 
bool max_cardinality_ = false
 

Detailed Description

template<class GT, class Cost = Dft_Dist<GT>, class SA = Dft_Show_Arc<GT>>
class Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA >

Functor wrapper for minimum-cost general matching.

Definition at line 381 of file Min_Cost_Matching.H.

Constructor & Destructor Documentation

◆ Compute_Minimum_Cost_General_Matching()

template<class GT , class Cost = Dft_Dist<GT>, class SA = Dft_Show_Arc<GT>>
Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA >::Compute_Minimum_Cost_General_Matching ( Cost  cost = Cost(),
SA  sa = SA(),
const bool  max_cardinality = false 
)
inline

Definition at line 388 of file Min_Cost_Matching.H.

Member Function Documentation

◆ operator()()

Member Data Documentation

◆ cost_

template<class GT , class Cost = Dft_Dist<GT>, class SA = Dft_Show_Arc<GT>>
Cost Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA >::cost_
private

◆ max_cardinality_

template<class GT , class Cost = Dft_Dist<GT>, class SA = Dft_Show_Arc<GT>>
bool Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA >::max_cardinality_ = false
private

◆ sa_

template<class GT , class Cost = Dft_Dist<GT>, class SA = Dft_Show_Arc<GT>>
SA Aleph::Compute_Minimum_Cost_General_Matching< GT, Cost, SA >::sa_
private

The documentation for this class was generated from the following file: