Changeset 2042:bdc953f2a449 in lemon0.x for demo
 Timestamp:
 04/07/06 11:54:35 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2681
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

demo/tight_edge_filter_map.h
r1956 r2042 33 33 edgedistance. 34 34 35 Let \f$ G=(V,A)\f$ be a directed graph (graph for short) and36 let \f$ \mathbb{F}\f$ be a number type.35 Let \f$ G=(V,A) \f$ be a directed graph (graph for short) and 36 let \f$ \mathbb{F} \f$ be a number type. 37 37 Given a distance function 38 \f$ d:E\to\mathbb{F}\f$,39 \f$ \pi:V\to\mathbb{F}\f$ is said to be a potetial40 w.r.t. \f$ d\f$38 \f$ d:E\to\mathbb{F} \f$, 39 \f$ \pi:V\to\mathbb{F} \f$ is said to be a potetial 40 w.r.t. \f$ d \f$ 41 41 if and only if 42 \f$ \pi(v)\le d(uv)+\pi(u)\f$ holds for each edge \f$uv\in E\f$42 \f$ \pi(v)\le d(uv)+\pi(u) \f$ holds for each edge \f$ uv\in E \f$ 43 43 (or the reverse inequality holds for each edge). 44 44 An edge is said to be tight if this inequality holds with equality,
Note: See TracChangeset
for help on using the changeset viewer.