MinCostArborescenceDefaultTraits< _Graph, _CostMap > Struct Template Reference

---

Detailed Description

template<class _Graph, class _CostMap>
struct lemon::MinCostArborescenceDefaultTraits< _Graph, _CostMap >

Default traits class of MinCostArborescence class.

Parameters:

	_Graph	Graph type.
	_CostMap	Type of cost map.

#include <lemon/min_cost_arborescence.h>

List of all members.

Public Types
typedef _Graph	Graph
	The graph type the algorithm runs on.
typedef _CostMap	CostMap
	The type of the map that stores the edge costs.
typedef CostMap::Value	Value
typedef Graph::template EdgeMap< bool >	ArborescenceMap
	The type of the map that stores which edges are in the arborescence.
typedef Graph::template NodeMap< typename Graph::Edge >	PredMap
	The type of the PredMap.
Static Public Member Functions
static ArborescenceMap *	createArborescenceMap (const Graph &_graph)
	Instantiates a ArborescenceMap.
static PredMap *	createPredMap (const Graph &_graph)
	Instantiates a PredMap.

---

Member Typedef Documentation

typedef _CostMap CostMap

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

typedef CostMap::Value Value

The value type of the costs.

typedef Graph::template EdgeMap<bool> ArborescenceMap

The type of the map that stores which edges are in the arborescence. It must meet the WriteMap concept. Initially it will be set to false on each edge. After it will set all arborescence edges once.

typedef Graph::template NodeMap<typename Graph::Edge> PredMap

The type of the PredMap. It is a node map with an edge value type.

---

Member Function Documentation

static ArborescenceMap* createArborescenceMap

(

const Graph &

_graph

)

[inline, static]

This function instantiates a ArborescenceMap.

Parameters:

_graph

is the graph, to which we would like to define the ArborescenceMap.

static PredMap* createPredMap

(

const Graph &

_graph

)

[inline, static]

This function instantiates a PredMap.

Parameters:

_graph

is the graph, to which we would like to define the PredMap.