MinCostMaxBipartiteMatchingDefaultTraits< _BpUGraph, _CostMap > Struct Template Reference


Detailed Description

template<typename _BpUGraph, typename _CostMap>
struct lemon::MinCostMaxBipartiteMatchingDefaultTraits< _BpUGraph, _CostMap >

Default traits class for minimum cost bipartite matching algoritms.

Parameters:
_BpUGraph The bipartite undirected graph type.
_CostMap Type of cost map.
#include <lemon/bipartite_matching.h>

List of all members.

Public Types

typedef _CostMap::Value Value
 The type of the cost of the undirected edges.
typedef _BpUGraph BpUGraph
 The undirected bipartite graph type the algorithm runs on.
typedef _CostMap CostMap
 The map of the edges costs.
typedef BpUGraph::template
NodeMap< int > 
HeapCrossRef
 The cross reference type used by heap.
typedef BinHeap< Value,
HeapCrossRef
Heap
 The heap type used by costed matching algorithms.

Static Public Member Functions

static HeapCrossRefcreateHeapCrossRef (const BpUGraph &graph)
 Instantiates a HeapCrossRef.
static HeapcreateHeap (HeapCrossRef &crossref)
 Instantiates a Heap.


Member Typedef Documentation

typedef BpUGraph::template NodeMap<int> HeapCrossRef

The cross reference type used by heap. Usually it is Graph::NodeMap<int>.

The heap type used by costed matching algorithms. It should minimize the priorities and the heap's key type is the graph's anode graph's node.

See also:
BinHeap


Member Function Documentation

static HeapCrossRef* createHeapCrossRef ( const BpUGraph 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.


Generated on Thu Jun 4 04:03:34 2009 for LEMON by  doxygen 1.5.9