COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/04/05 15:07:10 (17 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1863
Message:

wrapper -> adaptor

File:
1 moved

Legend:

Unmodified
Added
Removed
  • src/demo/sub_graph_adaptor_demo.cc

    r986 r1401  
    22
    33// Use a DIMACS max flow file as stdin.
    4 // sub_graph_wrapper_demo < dimacs_max_flow_file
     4// sub_graph_adaptor_demo < dimacs_max_flow_file
    55// This program computes a maximum number of edge-disjoint shortest paths
    66// between s and t.
     
    1212#include <lemon/dijkstra.h>
    1313#include <lemon/maps.h>
    14 #include <lemon/graph_wrapper.h>
     14#include <lemon/graph_adaptor.h>
    1515#include <lemon/dimacs.h>
    1616#include <lemon/preflow.h>
     
    5858//  ConstMap<Node, bool> const_true_map(true);
    5959  // This graph contains exaclty the tight edges.
    60 // typedef SubGraphWrapper<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
    61   typedef EdgeSubGraphWrapper<Graph, TightEdgeFilter> SubGW;
     60// typedef SubGraphAdaptor<Graph, ConstMap<Node, bool>, TightEdgeFilter> SubGW;
     61  typedef EdgeSubGraphAdaptor<Graph, TightEdgeFilter> SubGW;
    6262  SubGW gw(g, tight_edge_filter);
    6363
Note: See TracChangeset for help on using the changeset viewer.