Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type > Struct Template Reference

Result of minimum-cost perfect matching. More...

#include <Min_Cost_Matching.H>

Collaboration diagram for Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type >:
[legend]

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).
 

Detailed Description

template<typename Cost_Type = long long>
struct Aleph::Min_Cost_Perfect_Matching_Result< Cost_Type >

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.

Template Parameters
Cost_TypeNumeric type for total cost (default long long).

Definition at line 106 of file Min_Cost_Matching.H.

Member Data Documentation

◆ cardinality

template<typename Cost_Type = long long>
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.

◆ feasible

Whether a perfect matching exists.

Definition at line 108 of file Min_Cost_Matching.H.

◆ total_cost

Total cost if feasible.

Definition at line 109 of file Min_Cost_Matching.H.

Referenced by Aleph::compute_minimum_cost_perfect_general_matching().


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