Default traits class for NagamochiIbaraki class.
| GR | The undirected graph type. | 
| CM | Type of capacity map. | 
#include <lemon/nagamochi_ibaraki.h>
| Public Types | |
| typedef CM::Value | Value | 
| The type of the capacity map. | |
| typedef GR | Graph | 
| The undirected graph type the algorithm runs on. | |
| typedef CM | CapacityMap | 
| The type of the map that stores the edge capacities.  More... | |
| typedef Graph::template NodeMap< int > | HeapCrossRef | 
| The cross reference type used by heap.  More... | |
| typedef BinHeap< Value, HeapCrossRef, std::greater < Value > > | Heap | 
| The heap type used by NagamochiIbaraki algorithm.  More... | |
| Static Public Member Functions | |
| static CapacityMap * | createCapacityMap (const Graph &graph) | 
| Instantiates a CapacityMap.  More... | |
| static HeapCrossRef * | createHeapCrossRef (const Graph &g) | 
| Instantiates a HeapCrossRef.  More... | |
| static Heap * | createHeap (HeapCrossRef &r) | 
| Instantiates a Heap.  More... | |
| typedef CM CapacityMap | 
The type of the map that stores the edge capacities. It must meet the ReadMap concept.
| typedef Graph::template NodeMap<int> HeapCrossRef | 
The cross reference type used by heap. Usually Graph::NodeMap<int>. 
| typedef BinHeap<Value, HeapCrossRef, std::greater<Value> > Heap | 
The heap type used by NagamochiIbaraki algorithm. It has to maximize the priorities.
| 
 | inlinestatic | 
This function instantiates a CapacityMap.
| 
 | inlinestatic | 
This function instantiates a HeapCrossRef.
| g | is the graph, to which we would like to define the HeapCrossRef. | 
| 
 | inlinestatic | 
This function instantiates a Heap.
| r | is the cross reference of the heap. | 
 1.8.5
 1.8.5