MinCutDefaultTraits Struct Template Reference

#include <lemon/min_cut.h>

List of all members.


Detailed Description

template<typename _Graph, typename _CapacityMap>
struct lemon::MinCutDefaultTraits< _Graph, _CapacityMap >

Default traits class of MinCut class.
Parameters:
Graph Graph type.
CapacityMap Type of length map.


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::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 MinCut algorithm.
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 Public Member Functions

static AuxGraphcreateAuxGraph ()
 Instantiates a AuxGraph.
static CapacityMapcreateCapacityMap (const Graph &graph)
 Instantiates a CapacityMap.
static AuxCapacityMapcreateAuxCapacityMap (const AuxGraph &graph)
 Instantiates a AuxCapacityMap.
static HeapCrossRefcreateHeapCrossRef (const AuxGraph &graph)
 Instantiates a HeapCrossRef.
static HeapcreateHeap (HeapCrossRef &crossref)
 Instantiates a Heap.
static NodeRefMapcreateNodeRefMap (const AuxGraph &graph)
 Instantiates a NodeRefMap.
static ListRefMapcreateListRefMap (const Graph &graph)
 Instantiates a ListRefMap.


Member Typedef Documentation

typedef _CapacityMap CapacityMap

The type of the map that stores the edge capacities. It must meet the ReadMap concept.

typedef AuxGraph::UEdgeMap<Value> AuxCapacityMap

The type of the map that stores the auxing 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 MinCut algorithm. It should maximalize the priorities and the heap's key type is the aux graph's node.

See also:
BinHeap

MinCut

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.


Member Function Documentation

static AuxGraph* createAuxGraph (  )  [inline, static]

This function instantiates a AuxGraph.

static CapacityMap* createCapacityMap ( const Graph graph  )  [inline, static]

This function instantiates a CapacityMap.

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.

Parameters:
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.

Parameters:
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.


The documentation for this struct was generated from the following file:
Generated on Tue Oct 31 09:51:16 2006 for LEMON by  doxygen 1.5.1