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

Named parameter for setting the capacity map to a constMap< Edge , int , 1 >() instance More...

#include <lemon/nagamochi_ibaraki.h>

Inheritance diagram for NagamochiIbaraki< GR , CM , TR >::SetUnitCapacity:

Additional Inherited Members

Public Types inherited from NagamochiIbaraki< Graph , CapacityMap , SetUnitCapacityTraits >
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 , SetUnitCapacityTraits >
 NagamochiIbaraki (const Graph &graph, const CapacityMap &capacity)
 Constructor.
 NagamochiIbaraki (const Graph &graph)
 Constructor.
NagamochiIbaraki & tolerance (const Tolerance< Value > &tolerance)
 Sets the tolerance used by the algorithm.
const Tolerance< Value > & tolerance () const
 Returns a const reference to the tolerance.
 ~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 >
struct lemon::NagamochiIbaraki< GR , CM , TR >::SetUnitCapacity

Named parameter for setting the capacity map to a constMap< Edge , int , 1 >() instance