Default traits class of MaxCardinalitySearch class.
More...
#include <lemon/max_cardinality_search.h>
|
|
typedef GR | Digraph |
| | The digraph type the algorithm runs on.
|
| typedef CapMapSelector< CAP >::CapacityMap | CapacityMap |
| | The type of the map that stores the arc capacities.
|
|
typedef CapacityMap::Value | Value |
| | The type of the capacity of the arcs.
|
| typedef Digraph::template NodeMap< int > | HeapCrossRef |
| | The cross reference type used by heap.
|
| typedef HeapSelector< CapacityMap >::template Selector< Value , HeapCrossRef >::Heap | Heap |
| | The heap type used by MaxCardinalitySearch algorithm.
|
| typedef NullMap< typename Digraph::Node , bool > | ProcessedMap |
| | The type of the map that stores whether a node is processed.
|
| typedef Digraph::template NodeMap< Value > | CardinalityMap |
| | The type of the map that stores the cardinalities of the nodes.
|
template< typename GR , typename CAP >
struct lemon::MaxCardinalitySearchDefaultTraits< GR , CAP >
Default traits class of MaxCardinalitySearch class.
- Parameters
-
◆ CapacityMap
template< typename GR , typename CAP >
The type of the map that stores the arc capacities. It must meet the ReadMap concept.
◆ HeapCrossRef
template< typename GR , typename CAP >
The cross reference type used by heap. Usually it is Digraph::NodeMap< int >.
◆ Heap
template< typename GR , typename CAP >
◆ ProcessedMap
template< typename GR , typename CAP >
The type of the map that stores whether a node is processed. It must meet the WriteMap concept. By default it is a NullMap.
◆ CardinalityMap
template< typename GR , typename CAP >
The type of the map that stores the cardinalities of the nodes. It must meet the WriteMap concept.
◆ createCapacityMap()
template< typename GR , typename CAP >
This function instantiates a CapacityMap.
- Parameters
-
| digraph | is the digraph, to which we would like to define the CapacityMap. |
◆ createHeapCrossRef()
template< typename GR , typename CAP >
This function instantiates a HeapCrossRef.
- Parameters
-
| digraph | is the digraph, to which we would like to define the HeapCrossRef. |
◆ createHeap()
template< typename GR , typename CAP >
This function instantiates a Heap.
- Parameters
-
| crossref | The cross reference of the heap. |
◆ createProcessedMap()
template< typename GR , typename CAP >
This function instantiates a ProcessedMap.
- Parameters
-
| digraph | is the digraph, to which we would like to define the ProcessedMap |
◆ createCardinalityMap()
template< typename GR , typename CAP >