TightEdgeFilterMap Class Template Reference
#include <demo/tight_edge_filter_map.h>
Inherits MapBase< Graph::Edge, bool >.
Inheritance diagram for TightEdgeFilterMap:
[legend]List of all members.
Detailed Description
template<typename Graph, typename NodePotentialMap, typename EdgeDistanceMap>
class lemon::TightEdgeFilterMap< Graph, NodePotentialMap, EdgeDistanceMap >
Let
be a directed graph (graph for short) and let
be a number type. Given a distance function
,
is said to be a potetial w.r.t.
if and only if
holds for each edge
(or the reverse inequality holds for each edge). An edge is said to be tight if this inequality holds with equality, and the map returns true
exactly for those edges. To avoid rounding errors, it is recommended to use this class with exact number types, e.g. with int
.
The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:43:03 2006 for LEMON by
1.4.6