abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
Loading...
Searching...
No Matches
NagamochiIbaraki< GR , CM , TR >::SetStandardHeap< H , CR > Struct Template Reference

Named parameter for setting heap and cross reference type with automatic allocation More...

#include <lemon/nagamochi_ibaraki.h>

Inheritance diagram for NagamochiIbaraki< GR , CM , TR >::SetStandardHeap< H , CR >:

Additional Inherited Members

Public Types inherited from NagamochiIbaraki< Graph , CapacityMap , SetStandardHeapTraits< H , typename Graph::template NodeMap< int > > >
typedef Traits::Graph Graph
 The type of the underlying graph.
typedef Traits::CapacityMap CapacityMap
 The type of the capacity map.
typedef Traits::CapacityMap::Value Value
 The value type of the capacity map.
typedef Traits::Heap Heap
 The heap type used by the algorithm.
typedef Traits::HeapCrossRef HeapCrossRef
 The cross reference type used for the heap.
Public Member Functions inherited from NagamochiIbaraki< Graph , CapacityMap , SetStandardHeapTraits< H , typename Graph::template NodeMap< int > > >
NagamochiIbaraki & tolerance (const Tolerance< Value > &tolerance)
 Sets the tolerance used by the algorithm.
 ~NagamochiIbaraki ()
 Destructor.
NagamochiIbaraki & heap (Heap &hp, HeapCrossRef &cr)
 Sets the heap and the cross reference used by algorithm.
void init ()
 Initializes the internal data structures.
bool processNextPhase ()
 Processes the next phase.
void start ()
 Executes the algorithm.
void run ()
 Runs NagamochiIbaraki algorithm.
Value minCutValue () const
 Returns the min cut value.
Value minCutMap (CutMap &cutMap) const
 Returns a min cut in a NodeMap.

Detailed Description

template< typename GR , typename CM , typename TR >
template< class H , class CR = typename Graph::template NodeMap< int > >
struct lemon::NagamochiIbaraki< GR , CM , TR >::SetStandardHeap< H , CR >

Named parameter for setting heap and cross reference type with automatic allocation. They should have standard constructor interfaces to be able to automatically created by the algorithm (i.e. the graph should be passed to the constructor of the cross reference and the cross reference should be passed to the constructor of the heap). However, external heap and cross reference objects could also be passed to the algorithm using the heap() function before calling run() or init(). The heap has to maximize the priorities.

See also
SetHeap