![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Named parameter for setting heap and cross reference type More...
#include <lemon/nagamochi_ibaraki.h>
Additional Inherited Members | |
| Public Types inherited from NagamochiIbaraki< Graph , CapacityMap , SetHeapTraits< 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 , SetHeapTraits< 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. | |
Named parameter for setting heap and cross reference type. The heap has to maximize the priorities.