Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::BlossomGraph::Node Struct Reference

Detailed Description

Definition at line 181 of file perfect_matching.h.

#include <perfect_matching.h>

Public Member Functions

 Node (NodeIndex n)
bool IsInternal () const
bool IsFree () const
bool IsPlus () const
bool IsMinus () const
bool IsBlossom () const

Public Attributes

int type = 0
bool is_internal = false
NodeIndex parent
NodeIndex match
NodeIndex root
CostValue tree_dual_delta = CostValue(0)
CostValue pseudo_dual = CostValue(0)
CostValue dual = CostValue(0)
std::vector< NodeIndexblossom
CostValue saved_dual
CostValue saved_pseudo_dual
std::vector< NodeIndexsaved_blossom

Constructor & Destructor Documentation

◆ Node()

operations_research::BlossomGraph::Node::Node ( NodeIndex n)
inlineexplicit

Definition at line 182 of file perfect_matching.h.

Member Function Documentation

◆ IsBlossom()

bool operations_research::BlossomGraph::Node::IsBlossom ( ) const
inline

Definition at line 200 of file perfect_matching.h.

◆ IsFree()

bool operations_research::BlossomGraph::Node::IsFree ( ) const
inline

Definition at line 193 of file perfect_matching.h.

◆ IsInternal()

bool operations_research::BlossomGraph::Node::IsInternal ( ) const
inline

Definition at line 189 of file perfect_matching.h.

◆ IsMinus()

bool operations_research::BlossomGraph::Node::IsMinus ( ) const
inline

Definition at line 195 of file perfect_matching.h.

◆ IsPlus()

bool operations_research::BlossomGraph::Node::IsPlus ( ) const
inline

Definition at line 194 of file perfect_matching.h.

Member Data Documentation

◆ blossom

std::vector<NodeIndex> operations_research::BlossomGraph::Node::blossom

Definition at line 241 of file perfect_matching.h.

◆ dual

CostValue operations_research::BlossomGraph::Node::dual = CostValue(0)

Definition at line 235 of file perfect_matching.h.

◆ is_internal

bool operations_research::BlossomGraph::Node::is_internal = false

Definition at line 210 of file perfect_matching.h.

◆ match

NodeIndex operations_research::BlossomGraph::Node::match

Definition at line 218 of file perfect_matching.h.

◆ parent

NodeIndex operations_research::BlossomGraph::Node::parent

Definition at line 214 of file perfect_matching.h.

◆ pseudo_dual

CostValue operations_research::BlossomGraph::Node::pseudo_dual = CostValue(0)

Definition at line 231 of file perfect_matching.h.

◆ root

NodeIndex operations_research::BlossomGraph::Node::root

Definition at line 222 of file perfect_matching.h.

◆ saved_blossom

std::vector<NodeIndex> operations_research::BlossomGraph::Node::saved_blossom

Definition at line 253 of file perfect_matching.h.

◆ saved_dual

CostValue operations_research::BlossomGraph::Node::saved_dual

Definition at line 250 of file perfect_matching.h.

◆ saved_pseudo_dual

CostValue operations_research::BlossomGraph::Node::saved_pseudo_dual

Definition at line 252 of file perfect_matching.h.

◆ tree_dual_delta

CostValue operations_research::BlossomGraph::Node::tree_dual_delta = CostValue(0)

Definition at line 226 of file perfect_matching.h.

◆ type

int operations_research::BlossomGraph::Node::type = 0

Definition at line 207 of file perfect_matching.h.


The documentation for this struct was generated from the following file: