Definition at line 165 of file perfect_matching.h.
◆ BlossomGraph()
◆ AddEdge()
◆ Augment()
void Augment |
( |
EdgeIndex |
e | ) |
|
◆ ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue()
CostValue ComputeMaxCommonTreeDualDeltaAndResetPrimalEdgeQueue |
( |
| ) |
|
◆ DebugCheckNoPossiblePrimalUpdates()
void DebugCheckNoPossiblePrimalUpdates |
( |
| ) |
|
◆ DebugDualsAreFeasible()
bool DebugDualsAreFeasible |
( |
| ) |
const |
◆ DebugEdgeIsTightAndExternal()
bool DebugEdgeIsTightAndExternal |
( |
const Edge & |
edge | ) |
const |
◆ DebugString()
std::string DebugString |
( |
| ) |
const |
◆ DebugUpdateNodeDual()
◆ DEFINE_INT_TYPE() [1/3]
◆ DEFINE_INT_TYPE() [2/3]
DEFINE_INT_TYPE |
( |
EdgeIndex |
, |
|
|
int |
|
|
) |
| |
◆ DEFINE_INT_TYPE() [3/3]
◆ DisplayStats()
void DisplayStats |
( |
| ) |
const |
◆ Dual()
◆ DualObjective()
◆ EdgeDebugString()
std::string EdgeDebugString |
( |
EdgeIndex |
e | ) |
const |
◆ Expand()
◆ ExpandAllBlossoms()
void ExpandAllBlossoms |
( |
| ) |
|
◆ GetEdge()
const Edge & GetEdge |
( |
int |
e | ) |
const |
|
inline |
◆ GetNode()
const Node & GetNode |
( |
int |
n | ) |
const |
|
inline |
◆ Grow()
◆ Initialize()
◆ Match()
◆ NodeDebugString()
std::string NodeDebugString |
( |
NodeIndex |
n | ) |
const |
◆ NodeIsMatched()
◆ NumMatched()
◆ PrimalUpdates()
◆ Shrink()
void Shrink |
( |
EdgeIndex |
e | ) |
|
◆ Slack()
◆ UpdateAllTrees()
◆ kMaxCostValue
const BlossomGraph::CostValue kMaxCostValue |
|
static |
◆ kNoEdgeIndex
const BlossomGraph::EdgeIndex kNoEdgeIndex |
|
static |
◆ kNoNodeIndex
const BlossomGraph::NodeIndex kNoNodeIndex |
|
static |
The documentation for this class was generated from the following files: