Changeset 986:e997802b855c in lemon0.x for src/demo/tight_edge_filter_map.h
 Timestamp:
 11/13/04 13:53:28 (20 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1376
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/demo/tight_edge_filter_map.h
r929 r986 32 32 /// A nodemap node_potential is said to be a potential w.r.t. 33 33 /// an edgemap edge_distance 34 /// if and only if for each edge e, node_potential[g. head(e)]35 /// <= edge_distance[e]+node_potential[g. tail(e)]34 /// if and only if for each edge e, node_potential[g.target(e)] 35 /// <= edge_distance[e]+node_potential[g.source(e)] 36 36 /// (or the reverse inequality holds for each edge). 37 37 /// An edge is said to be tight if this inequality holds with equality, … … 52 52 edge_distance(&_edge_distance) { } 53 53 bool operator[](const typename Graph::Edge& e) const { 54 return ((*node_potential)[g> head(e)] ==55 (*edge_distance)[e]+(*node_potential)[g> tail(e)]);54 return ((*node_potential)[g>target(e)] == 55 (*edge_distance)[e]+(*node_potential)[g>source(e)]); 56 56 } 57 57 };
Note: See TracChangeset
for help on using the changeset viewer.