![]() |
OR-Tools
8.2
|
Definition at line 50 of file perfect_matching.h.
Public Types | |
enum | Status { OPTIMAL = 0 , INFEASIBLE = 1 , INTEGER_OVERFLOW = 2 , COST_OVERFLOW = 3 } |
Public Member Functions | |
MinCostPerfectMatching () | |
MinCostPerfectMatching (int num_nodes) | |
void | Reset (int num_nodes) |
void | AddEdgeWithCost (int tail, int head, int64 cost) |
ABSL_MUST_USE_RESULT Status | Solve () |
int64 | OptimalCost () const |
int | Match (int node) const |
const std::vector< int > & | Matches () const |
enum Status |
Enumerator | |
---|---|
OPTIMAL | |
INFEASIBLE | |
INTEGER_OVERFLOW | |
COST_OVERFLOW |
Definition at line 81 of file perfect_matching.h.
|
inline |
Definition at line 54 of file perfect_matching.h.
|
inlineexplicit |
Definition at line 55 of file perfect_matching.h.
void AddEdgeWithCost | ( | int | tail, |
int | head, | ||
int64 | cost | ||
) |
Definition at line 27 of file perfect_matching.cc.
|
inline |
Definition at line 109 of file perfect_matching.h.
|
inline |
Definition at line 113 of file perfect_matching.h.
|
inline |
Definition at line 102 of file perfect_matching.h.
void Reset | ( | int | num_nodes | ) |
Definition at line 21 of file perfect_matching.cc.
MinCostPerfectMatching::Status Solve | ( | ) |
Definition at line 39 of file perfect_matching.cc.