TightEdgeFilterMap< Graph, NodePotentialMap, EdgeDistanceMap > Class Template Reference

Detailed Description

template<typename Graph, typename NodePotentialMap, typename EdgeDistanceMap>
class lemon::TightEdgeFilterMap< Graph, NodePotentialMap, EdgeDistanceMap >

Let $ G=(V,A) $ be a directed graph (graph for short) and let $ \mathbb{F} $ be a number type. Given a distance function $ d:E\to\mathbb{F} $, $ \pi:V\to\mathbb{F} $ is said to be a potetial w.r.t. $ d $ if and only if $ \pi(v)\le d(uv)+\pi(u) $ holds for each edge $ uv\in E $ (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. #include <demo/tight_edge_filter_map.h>

Inheritance diagram for TightEdgeFilterMap< Graph, NodePotentialMap, EdgeDistanceMap >:

Inheritance graph
[legend]

List of all members.

Generated on Thu Jun 4 04:06:43 2009 for LEMON by  doxygen 1.5.9