Named parameter for setting heap and cross reference type. The heap has to maximize the priorities.
#include <lemon/nagamochi_ibaraki.h>
Additional Inherited Members | |
Public Types inherited from NagamochiIbaraki< Graph, CapacityMap, SetHeapTraits< H, CR > > | |
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, CR > > | |
NagamochiIbaraki (const Graph &graph, const CapacityMap &capacity) | |
Constructor. More... | |
NagamochiIbaraki (const Graph &graph) | |
Constructor. More... | |
~NagamochiIbaraki () | |
Destructor. More... | |
NagamochiIbaraki & | heap (Heap &hp, HeapCrossRef &cr) |
Sets the heap and the cross reference used by algorithm. More... | |
void | init () |
Initializes the internal data structures. More... | |
bool | processNextPhase () |
Processes the next phase. More... | |
void | start () |
Executes the algorithm. More... | |
void | run () |
Runs NagamochiIbaraki algorithm. More... | |
Value | minCutValue () const |
Returns the min cut value. More... | |
Value | minCutMap (CutMap &cutMap) const |
Returns a min cut in a NodeMap. More... | |