Changeset 932:ade3cdb9b45d in lemon-0.x for src/lemon

Timestamp:

10/01/04 12:08:43 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

New EdgeSubGraphWrapper? class specializing SubGraphWrapper? in the way that only the edge-set can be filtered.

File:

• src/lemon/graph_wrapper.h (modified) (2 diffs)

src/lemon/graph_wrapper.h

@@ -431 +431 @@
   TightEdgeFilter tight_edge_filter(g, dijkstra.distMap(), length);
   
-  ConstMap<Node, bool> const_true_map(true);
-  typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
-  SubGW gw(g, const_true_map, tight_edge_filter);
+  typedef EdgeSubGraphWrapper<Graph, TightEdgeFilter> SubGW;
+  SubGW gw(g, tight_edge_filter);
   \endcode
   Then, the maximum nimber of edge-disjoint \c s-\c t paths are computed 
@@ -672 +671 @@
 
 
+  /*! \brief A wrapper for hiding edges from a graph.
+
+  \warning Graph wrappers are in even more experimental state than the other
+  parts of the lib. Use them at you own risk.
+  
+  A wrapper for hiding edges from a graph.
+  This wrapper specializes SubGraphWrapper in the way that only the edge-set 
+  can be filtered.
+  \author Marton Makai
+  */
+  template<typename Graph, typename EdgeFilterMap>
+  class EdgeSubGraphWrapper : 
+    public SubGraphWrapper<Graph, ConstMap<typename Graph::Node,bool>, 
+                           EdgeFilterMap> {
+  public:
+    typedef SubGraphWrapper<Graph, ConstMap<typename Graph::Node,bool>, 
+                            EdgeFilterMap> Parent;
+  protected:
+    ConstMap<typename Graph::Node, bool> const_true_map;
+  public:
+    EdgeSubGraphWrapper(Graph& _graph, EdgeFilterMap& _edge_filter_map) : 
+      Parent(), const_true_map(true) { 
+      Parent::setGraph(_graph);
+      Parent::setNodeFilterMap(const_true_map);
+      Parent::setEdgeFilterMap(_edge_filter_map);
+    }
+  };
+
 
   template<typename Graph>