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