Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::matching_blossom Namespace Reference

Classes

class  AlternatingTree
 
class  AuxEdge
 
class  AuxGraph
 
class  AuxNode
 
class  BaseIteratorContainer
 Dummy class for scoped iteration of a std::unordered_map. More...
 
class  BlossomHelper
 Helper class for the blossom matching algorithms. More...
 
class  BlossomPQ
 A custom priority queue for the blossom algorithm, based on the PrioritizedMapQueue. It uses a std::unordered_map to store the handles, handles merge operations correctly, can iterate over its elements and offers a remove() function. More...
 
class  BlossomVHelper
 Helper class for the blossom matching algorithms. More...
 
class  Cycle
 
class  MapKeyIterator
 Iterator to access the keys of a std::unordered_map. More...
 
class  MapValueIterator
 Iterator to access the values of a std::unordered_map. More...
 
class  Pseudonode
 Helper class representing a pseudonode in the Blossom algorithm. More...
 

Typedefs

template<typename Key , typename Value >
using KeyIteratorContainer = BaseIteratorContainer< MapKeyIterator, Key, Value >
 
template<typename Key , typename Value >
using ValueIteratorContainer = BaseIteratorContainer< MapValueIterator, Key, Value >
 

Functions

template<class TWeight >
TWeight getWeight (edge e, const EdgeArray< TWeight > &weights)
 Helper function to get the edge weight of e from the EdgeArray weights. More...
 
template<class TWeight >
TWeight getWeight (edge e, const GraphAttributes &GA)
 Helper function to get the edge weight of e from the GraphAttributes weights. More...
 
template<class TWeight >
TWeight infinity ()
 Helper function to get the maximum value for a given weight type. More...
 
template<class K , class V >
V * tryGetPointerFromMap (const std::unordered_map< K, V * > &map, const K &key)
 Return the pointer belonging to key key int the given map map, or nullptr if key does not exist. More...
 

Typedef Documentation

◆ KeyIteratorContainer

template<typename Key , typename Value >
using ogdf::matching_blossom::KeyIteratorContainer = typedef BaseIteratorContainer<MapKeyIterator, Key, Value>

Definition at line 125 of file utils.h.

◆ ValueIteratorContainer

template<typename Key , typename Value >
using ogdf::matching_blossom::ValueIteratorContainer = typedef BaseIteratorContainer<MapValueIterator, Key, Value>

Definition at line 128 of file utils.h.

Function Documentation

◆ getWeight() [1/2]

template<class TWeight >
TWeight ogdf::matching_blossom::getWeight ( edge  e,
const EdgeArray< TWeight > &  weights 
)

Helper function to get the edge weight of e from the EdgeArray weights.

Definition at line 62 of file utils.h.

◆ getWeight() [2/2]

template<class TWeight >
TWeight ogdf::matching_blossom::getWeight ( edge  e,
const GraphAttributes GA 
)

Helper function to get the edge weight of e from the GraphAttributes weights.

Definition at line 68 of file utils.h.

◆ infinity()

template<class TWeight >
TWeight ogdf::matching_blossom::infinity ( )

Helper function to get the maximum value for a given weight type.

Definition at line 43 of file utils.h.

◆ tryGetPointerFromMap()

template<class K , class V >
V* ogdf::matching_blossom::tryGetPointerFromMap ( const std::unordered_map< K, V * > &  map,
const K &  key 
)

Return the pointer belonging to key key int the given map map, or nullptr if key does not exist.

Definition at line 51 of file utils.h.