All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance
#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 () | |
| NagamochiIbaraki & | heap (Heap &hp, HeapCrossRef &cr) |
| Sets the heap and the cross reference used by algorithm. | |
| void | init () |
| 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. | |
1.8.2
