|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Result of minimum-cost perfect matching. More...
#include <Min_Cost_Matching.H>
Public Attributes | |
| bool | feasible = false |
| Whether a perfect matching exists. | |
| Cost_Type | total_cost = Cost_Type{0} |
| Total cost if feasible. | |
| size_t | cardinality = 0 |
Cardinality (|V|/2 if feasible). | |
Result of minimum-cost perfect matching.
If feasible is true, matching contains a perfect matching and cardinality == |V|/2 (for even |V|). If false, no perfect matching exists and the output matching is empty.
| Cost_Type | Numeric type for total cost (default long long). |
Definition at line 106 of file Min_Cost_Matching.H.
| size_t Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type >::cardinality = 0 |
Cardinality (|V|/2 if feasible).
Definition at line 110 of file Min_Cost_Matching.H.
| bool Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type >::feasible = false |
Whether a perfect matching exists.
Definition at line 108 of file Min_Cost_Matching.H.
| Cost_Type Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type >::total_cost = Cost_Type{0} |
Total cost if feasible.
Definition at line 109 of file Min_Cost_Matching.H.
Referenced by Aleph::compute_minimum_cost_perfect_general_matching().