# Changeset 2081:94a7deb46c07 in lemon-0.x for demo/tight_edge_filter_map.h

Ignore:
Timestamp:
05/12/06 17:29:42 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2744
Message:

New demo file for computing disjoint paths

Doc review

 r2042 */ #ifndef LEMON_TIGHT_EDGE_FILTER_MAP_H #define LEMON_TIGHT_EDGE_FILTER_MAP_H #ifndef DEMO_TIGHT_EDGE_FILTER_MAP_H #define DEMO_TIGHT_EDGE_FILTER_MAP_H #include // /// \file // /// \brief Maximum flow algorithms. // /// \ingroup galgs /// \file /// \brief Tight edge filter map. /// /// Tight edge filter map is bool map on the edges of the graph /// which filters the edges which are not tight for a node-potential. /// It is used in the \ref sub_graph_adaptor_demo.cc file. /// /// \include tight_edge_filter_map.h namespace lemon { /*! \brief A map for filtering the edge-set to those edges which are tight w.r.t. a node-potential and edge-distance. Let \f$G=(V,A) \f$ be a directed graph (graph for short) and let \f$\mathbb{F} \f$ be a number type. Given a distance function \f$d:E\to\mathbb{F} \f$, \f$\pi:V\to\mathbb{F} \f$ is said to be a potetial w.r.t. \f$d \f$ if and only if \f$\pi(v)\le d(uv)+\pi(u) \f$ holds for each edge \f$uv\in E \f$ (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 \c true exactly for those edges. To avoid rounding errors, it is recommended to use this class with exact number types, e.g. with \c int. */ /// \brief A map for filtering the edge-set to those edges /// which are tight w.r.t. a node-potential and /// edge-distance. /// /// Let \f$G=(V,A) \f$ be a directed graph (graph for short) and /// let \f$\mathbb{F} \f$ be a number type. /// Given a distance function /// \f$d:E\to\mathbb{F} \f$, /// \f$\pi:V\to\mathbb{F} \f$ is said to be a potetial /// w.r.t. \f$d \f$ /// if and only if /// \f$\pi(v)\le d(uv)+\pi(u) \f$ holds for each edge \f$uv\in E \f$ /// (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 \c true exactly for those edges. /// To avoid rounding errors, it is recommended to use this class with exact /// number types, e.g. with \c int. template } //namespace lemon #endif //LEMON_TIGHT_EDGE_FILTER_MAP_H #endif //DEMO_TIGHT_EDGE_FILTER_MAP_H