Definition at line 50 of file perfect_matching.h.
#include <perfect_matching.h>
◆ Status
| Enumerator |
|---|
| OPTIMAL | |
| INFEASIBLE | |
| INTEGER_OVERFLOW | |
| COST_OVERFLOW | |
Definition at line 81 of file perfect_matching.h.
◆ MinCostPerfectMatching() [1/2]
| operations_research::MinCostPerfectMatching::MinCostPerfectMatching |
( |
| ) |
|
|
inline |
◆ MinCostPerfectMatching() [2/2]
| operations_research::MinCostPerfectMatching::MinCostPerfectMatching |
( |
int | num_nodes | ) |
|
|
inlineexplicit |
◆ AddEdgeWithCost()
| void operations_research::MinCostPerfectMatching::AddEdgeWithCost |
( |
int | tail, |
|
|
int | head, |
|
|
int64_t | cost ) |
◆ Match()
| int operations_research::MinCostPerfectMatching::Match |
( |
int | node | ) |
const |
|
inline |
◆ Matches()
| const std::vector< int > & operations_research::MinCostPerfectMatching::Matches |
( |
| ) |
const |
|
inline |
◆ OptimalCost()
| int64_t operations_research::MinCostPerfectMatching::OptimalCost |
( |
| ) |
const |
|
inline |
◆ Reset()
| void operations_research::MinCostPerfectMatching::Reset |
( |
int | num_nodes | ) |
|
◆ Solve()
The documentation for this class was generated from the following files: