| Graph | Graph type. | |
| CapacityMap | Type of length map. |
#include <lemon/nagamochi_ibaraki.h>
Public Types | |
| typedef _CapacityMap::Value | Value |
| The type of the capacity of the edges. | |
| typedef _Graph | Graph |
| The graph type the algorithm runs on. | |
| typedef ListUGraph | AuxGraph |
| The AuxGraph type which is an Graph. | |
| typedef _CapacityMap | CapacityMap |
| The type of the map that stores the edge capacities. | |
| typedef AuxGraph::NodeMap< Value > | AuxCutValueMap |
| The CutValueMap type. | |
| typedef AuxGraph::UEdgeMap< Value > | AuxCapacityMap |
| The AuxCapacityMap type. | |
| typedef AuxGraph::NodeMap< int > | HeapCrossRef |
| The cross reference type used by heap. | |
| typedef _min_cut_bits::HeapSelector < CapacityMap >::template Selector< Value, HeapCrossRef > ::Heap | Heap |
| The heap type used by NagamochiIbaraki algorithm. | |
| typedef AuxGraph::template NodeMap< typename Graph::Node > | NodeRefMap |
| typedef Graph::template NodeMap< typename Graph::Node > | ListRefMap |
Static Public Member Functions | |
| static AuxGraph * | createAuxGraph () |
| Instantiates a AuxGraph. | |
| static CapacityMap * | createCapacityMap (const Graph &graph) |
| Instantiates a CapacityMap. | |
| static AuxCutValueMap * | createAuxCutValueMap (const AuxGraph &graph) |
| Instantiates a AuxCutValueMap. | |
| static AuxCapacityMap * | createAuxCapacityMap (const AuxGraph &graph) |
| Instantiates a AuxCapacityMap. | |
| static HeapCrossRef * | createHeapCrossRef (const AuxGraph &graph) |
| Instantiates a HeapCrossRef. | |
| static Heap * | createHeap (HeapCrossRef &crossref) |
| Instantiates a Heap. | |
| static NodeRefMap * | createNodeRefMap (const AuxGraph &graph) |
| Instantiates a NodeRefMap. | |
| static ListRefMap * | createListRefMap (const Graph &graph) |
| Instantiates a ListRefMap. | |
| typedef _CapacityMap CapacityMap |
The type of the map that stores the edge capacities. It must meet the ReadMap concept.
| typedef AuxGraph::NodeMap<Value> AuxCutValueMap |
The type of the map that stores the cut value of a node.
| typedef AuxGraph::UEdgeMap<Value> AuxCapacityMap |
The type of the map that stores the auxiliary edge capacities.
| typedef AuxGraph::NodeMap<int> HeapCrossRef |
The cross reference type used by heap. Usually it is Graph::NodeMap<int>.
| typedef _min_cut_bits ::HeapSelector<CapacityMap>::template Selector<Value, HeapCrossRef>::Heap Heap |
The heap type used by NagamochiIbaraki algorithm. It should maximalize the priorities and the heap's key type is the aux graph's node.
| typedef AuxGraph ::template NodeMap<typename Graph::Node> NodeRefMap |
Map from the AuxGraph's node type to the Graph's node type.
| typedef Graph ::template NodeMap<typename Graph::Node> ListRefMap |
Map from the Graph's node type to the Graph's node type.
| static CapacityMap* createCapacityMap | ( | const Graph & | graph | ) | [inline, static] |
This function instantiates a CapacityMap.
| static AuxCutValueMap* createAuxCutValueMap | ( | const AuxGraph & | graph | ) | [inline, static] |
This function instantiates a AuxCutValueMap.
| static AuxCapacityMap* createAuxCapacityMap | ( | const AuxGraph & | graph | ) | [inline, static] |
This function instantiates a AuxCapacityMap.
| static HeapCrossRef* createHeapCrossRef | ( | const AuxGraph & | graph | ) | [inline, static] |
This function instantiates a HeapCrossRef.
| graph | is the graph, to which we would like to define the HeapCrossRef. |
| static Heap* createHeap | ( | HeapCrossRef & | crossref | ) | [inline, static] |
This function instantiates a Heap.
| crossref | The cross reference of the heap. |
| static NodeRefMap* createNodeRefMap | ( | const AuxGraph & | graph | ) | [inline, static] |
This function instantiates a NodeRefMap.
| static ListRefMap* createListRefMap | ( | const Graph & | graph | ) | [inline, static] |
This function instantiates a ListRefMap.
1.5.9