PotentialDifferenceMap Class Template Reference
[Graph Maps]

#include <lemon/graph_utils.h>

List of all members.


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.


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.)

PotentialDifferenceMap< Graph,
NodeMap > 
potentialDifferenceMap (const Graph &graph, const NodeMap &potential)
 Just returns a PotentialDifferenceMap.


Constructor & Destructor Documentation

PotentialDifferenceMap const Graph _graph,
const NodeMap &  _potential
[inline]
 

Contructor of the map


Member Function Documentation

Value operator[] const Key &  edge  )  const [inline]
 

Const subscription operator


The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:41:36 2006 for LEMON by  doxygen 1.4.6