NagamochiIbarakiDefaultTraits
Declared in lemon/nagamochi_ibaraki.h, in the group Minimum Cut Algorithms; the same struct on the Doxygen site.
-
template< typename GR , typename CM >
struct NagamochiIbarakiDefaultTraits Default traits class for NagamochiIbaraki class.
- Template Parameters:
GR – The undirected graph type.
CM – Type of capacity map.
Public Types
-
typedef CM CapacityMap
The type of the map that stores the edge capacities. It must meet the ReadMap concept.
-
typedef Graph::template NodeMap< int > HeapCrossRef
The cross reference type used by heap. Usually
Graph::NodeMap< int >.
-
typedef BinHeap< Value , HeapCrossRef , std::greater< Value > > Heap
The heap type used by NagamochiIbaraki algorithm. It has to maximize the priorities.
See also
See also
Public Static Functions
-
static inline CapacityMap * createCapacityMap( const Graph & graph )
Instantiates a CapacityMap.
This function instantiates a CapacityMap.
-
static inline HeapCrossRef * createHeapCrossRef( const Graph & g )
Instantiates a HeapCrossRef.
This function instantiates a HeapCrossRef.
- Parameters:
g – is the graph, to which we would like to define the HeapCrossRef.
-
static inline Heap * createHeap( HeapCrossRef & r )
Instantiates a Heap.
This function instantiates a Heap.
- Parameters:
r – is the cross reference of the heap.