GoldbergTarjanDefaultTraits< _Graph, _CapacityMap > Struct Template Reference

---

Detailed Description

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

Default traits class of GoldbergTarjan class.

Parameters:

	_Graph	Graph type.
	_CapacityMap	Type of capacity map.

#include <lemon/goldberg_tarjan.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 length of the edges.
typedef Graph::template EdgeMap< Value >	FlowMap
	The map type that stores the flow values.
typedef LinkedElevator< Graph, typename Graph::Node >	Elevator
	The eleavator type used by GoldbergTarjan algorithm.
typedef Tolerance< Value >	Tolerance
	The tolerance used by the algorithm.
Static Public Member Functions
static FlowMap *	createFlowMap (const Graph &graph)
	Instantiates a FlowMap.
static Elevator *	createElevator (const Graph &graph, int max_level)
	Instantiates an Elevator.

---

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 EdgeMap<Value> FlowMap

The map type that stores the flow values. It must meet the ReadWriteMap concept.

typedef LinkedElevator<Graph, typename Graph::Node> Elevator

The elevator type used by GoldbergTarjan algorithm.

See also:

Elevator

LinkedElevator

typedef Tolerance<Value> Tolerance

The tolerance used by the algorithm to handle inexact computation.

---

Member Function Documentation

static FlowMap* createFlowMap

(

const Graph &

graph

)

[inline, static]

This function instantiates a FlowMap.

Parameters:

graph

The graph, to which we would like to define the flow map.

static Elevator* createElevator	(	const Graph &	graph,
		int	max_level
	)			[inline, static]

This function instantiates a Elevator.

Parameters:

	graph	The graph, to which we would like to define the elevator.
	max_level	The maximum level of the elevator.