PotentialDifferenceMap< Graph, NodeMap > Class Template Reference
[Graph Maps]

---

Detailed Description

template<typename Graph, typename NodeMap>
class lemon::PotentialDifferenceMap< Graph, NodeMap >

If there is an potential map on the nodes then we can get an edge map as we get the substraction of the values of the target and source. #include <lemon/graph_utils.h>

List of all members.

Public Member Functions
	PotentialDifferenceMap (const Graph &_graph, const NodeMap &_potential)
	Constructor.
Value	operator[] (const Key &edge) const
	Const subscription operator.
Related Functions
(Note that these are not member functions.)
template<typename Graph , typename NodeMap >
PotentialDifferenceMap< Graph, NodeMap >	potentialDifferenceMap (const Graph &graph, const NodeMap &potential)
	Returns a PotentialDifferenceMap.

---

Constructor & Destructor Documentation

PotentialDifferenceMap	(	const Graph &	_graph,
		const NodeMap &	_potential
	)			[inline, explicit]

Contructor of the map

---

Member Function Documentation

Value operator[]

(

const Key &

edge

)

const [inline]

Const subscription operator