MaxCardinalitySearchDefaultTraits< _Graph, _CapacityMap > Struct Template Reference

---

Detailed Description

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

Default traits class of MaxCardinalitySearch class.

Parameters:

	Graph	Graph type.
	CapacityMap	Type of length map.

#include <lemon/nagamochi_ibaraki.h>

List of all members.

Public Types
typedef _Graph	Graph
	The graph type the algorithm runs on.
typedef _CapacityMap	CapacityMap
	The type of the map that stores the edge capacities.
typedef CapacityMap::Value	Value
	The type of the capacity of the edges.
typedef Graph::template 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 MaxCardinalitySearch algorithm.
typedef NullMap< typename Graph::Node, bool >	ProcessedMap
	The type of the map that stores whether a nodes is processed.
typedef Graph::template NodeMap< Value >	CardinalityMap
	The type of the map that stores the cardinalties of the nodes.
Static Public Member Functions
static HeapCrossRef *	createHeapCrossRef (const Graph &graph)
	Instantiates a HeapCrossRef.
static Heap *	createHeap (HeapCrossRef &crossref)
	Instantiates a Heap.
static ProcessedMap *	createProcessedMap (const Graph &graph)
	Instantiates a ProcessedMap.
static CardinalityMap *	createCardinalityMap (const Graph &graph)
	Instantiates a CardinalityMap.

---

Member Typedef Documentation

typedef _CapacityMap 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 it is Graph::NodeMap<int>.

typedef _min_cut_bits ::HeapSelector<CapacityMap>::template Selector<Value, HeapCrossRef>::Heap Heap

The heap type used by MaxCardinalitySearch algorithm. It should maximalize the priorities. The default heap type is the BinHeap, but it is specialized when the CapacityMap is ConstMap<Graph::Node, Const<int, 1> > to BucketHeap.

See also:

MaxCardinalitySearch

typedef NullMap<typename Graph::Node, bool> ProcessedMap

The type of the map that stores whether a nodes is processed. It must meet the WriteMap concept. By default it is a NullMap.

typedef Graph::template NodeMap<Value> CardinalityMap

The type of the map that stores the cardinalities of the nodes. It must meet the WriteMap concept.

---

Member Function Documentation

static HeapCrossRef* createHeapCrossRef

(

const Graph &

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 ProcessedMap* createProcessedMap

(

const Graph &

graph

)

[inline, static]

This function instantiates a ProcessedMap.

Parameters:

graph

is the graph, to which we would like to define the ProcessedMap

static CardinalityMap* createCardinalityMap

(

const Graph &

graph

)

[inline, static]

This function instantiates a CardinalityMap.

Parameters:

graph

is the graph, to which we would like to define the CardinalityMap