Changeset 863:d27bbe17b0b8 in lemon-0.x for src/work/marci/augmenting_flow.h

Timestamp:

09/16/04 13:11:01 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1163

Message:

An edge-map which shows the tight edges w.r.t a potential and an edge-distance function.

File:

• src/work/marci/augmenting_flow.h (modified) (3 diffs)

src/work/marci/augmenting_flow.h

@@ -4 +4 @@
 
 #include <vector>
-//#include <queue>
-//#include <stack>
 #include <iostream>
 
@@ -12 +10 @@
 #include <hugo/invalid.h>
 #include <hugo/maps.h>
+#include <tight_edge_filter_map.h>
 
 /// \file
@@ -18 +17 @@
 
 namespace hugo {
-
-  /// \brief A map for filtering the edge-set to those edges 
-  /// which are tight w.r.t. some node_potential map and 
-  /// edge_distance map.
-  ///
-  /// A node-map node_potential is said to be a potential w.r.t. 
-  /// an edge-map edge_distance 
-  /// if and only if for each edge e, node_potential[g.head(e)] 
-  /// <= edge_distance[e]+node_potential[g.tail(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 
-  /// types, e.g. with int.
-  template<typename Graph, 
-           typename NodePotentialMap, typename EdgeDistanceMap>
-  class TightEdgeFilterMap {
-  protected:
-    const Graph* g;
-    NodePotentialMap* node_potential;
-    EdgeDistanceMap* edge_distance;
-  public:
-    TightEdgeFilterMap(Graph& _g, NodePotentialMap& _node_potential, 
-                       EdgeDistanceMap& _edge_distance) : 
-      g(&_g), node_potential(&_node_potential), 
-      edge_distance(&_edge_distance) { }
-//     void set(const typename Graph::Node& n, int a) {
-//       pot->set(n, a);
-//     }
-//     int operator[](const typename Graph::Node& n) const { 
-//       return (*node_potential)[n]; 
-//     }
-    bool operator[](const typename Graph::Edge& e) const {
-      return ((*node_potential)[g->head(e)] == 
-              (*edge_distance)[e]+(*node_potential)[g->tail(e)]);
-    }
-  };
 
   /// \addtogroup galgs