Definition at line 181 of file perfect_matching.h.
#include <perfect_matching.h>
◆ Node()
| operations_research::BlossomGraph::Node::Node |
( |
NodeIndex | n | ) |
|
|
inlineexplicit |
◆ IsBlossom()
| bool operations_research::BlossomGraph::Node::IsBlossom |
( |
| ) |
const |
|
inline |
◆ IsFree()
| bool operations_research::BlossomGraph::Node::IsFree |
( |
| ) |
const |
|
inline |
◆ IsInternal()
| bool operations_research::BlossomGraph::Node::IsInternal |
( |
| ) |
const |
|
inline |
◆ IsMinus()
| bool operations_research::BlossomGraph::Node::IsMinus |
( |
| ) |
const |
|
inline |
◆ IsPlus()
| bool operations_research::BlossomGraph::Node::IsPlus |
( |
| ) |
const |
|
inline |
◆ blossom
| std::vector<NodeIndex> operations_research::BlossomGraph::Node::blossom |
◆ dual
◆ is_internal
| bool operations_research::BlossomGraph::Node::is_internal = false |
◆ match
| NodeIndex operations_research::BlossomGraph::Node::match |
◆ parent
| NodeIndex operations_research::BlossomGraph::Node::parent |
◆ pseudo_dual
◆ root
| NodeIndex operations_research::BlossomGraph::Node::root |
◆ saved_blossom
| std::vector<NodeIndex> operations_research::BlossomGraph::Node::saved_blossom |
◆ saved_dual
| CostValue operations_research::BlossomGraph::Node::saved_dual |
◆ saved_pseudo_dual
| CostValue operations_research::BlossomGraph::Node::saved_pseudo_dual |
◆ tree_dual_delta
◆ type
| int operations_research::BlossomGraph::Node::type = 0 |
The documentation for this struct was generated from the following file: