Changeset 1401:9588dcef6793 in lemon-0.x for src/demo/sub_graph_adaptor_demo.cc

Timestamp:

05/04/05 15:07:10 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

wrapper -> adaptor

File:

• src/demo/sub_graph_adaptor_demo.cc (moved) (moved from src/demo/sub_graph_wrapper_demo.cc) (3 diffs)

src/demo/sub_graph_adaptor_demo.cc

@@ -2 +2 @@
 
 // Use a DIMACS max flow file as stdin.
-// sub_graph_wrapper_demo < dimacs_max_flow_file
+// sub_graph_adaptor_demo < dimacs_max_flow_file
 // This program computes a maximum number of edge-disjoint shortest paths
 // between s and t.
@@ -12 +12 @@
 #include <lemon/dijkstra.h>
 #include <lemon/maps.h>
-#include <lemon/graph_wrapper.h>
+#include <lemon/graph_adaptor.h>
 #include <lemon/dimacs.h>
 #include <lemon/preflow.h>
@@ -58 +58 @@
 //  ConstMap<Node, bool> const_true_map(true);
   // This graph contains exaclty the tight edges.
-// typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
-  typedef EdgeSubGraphWrapper<Graph, TightEdgeFilter> SubGW;
+// typedef SubGraphAdaptor<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
+  typedef EdgeSubGraphAdaptor<Graph, TightEdgeFilter> SubGW;
   SubGW gw(g, tight_edge_filter);