COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
10/16/04 02:20:13 (20 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1293
Message:

It's time to design an iterable generic bfs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/augmenting_flow.h

    r921 r944  
    77
    88#include <lemon/graph_wrapper.h>
    9 #include <bfs_dfs.h>
     9//#include <bfs_dfs.h>
     10#include <bfs_mm.h>
    1011#include <lemon/invalid.h>
    1112#include <lemon/maps.h>
    12 #include <lemon/tight_edge_filter_map.h>
     13#include <demo/tight_edge_filter_map.h>
    1314
    1415/// \file
     
    1718
    1819namespace lemon {
     20  using lemon::marci::BfsIterator;
     21  using lemon::marci::DfsIterator;
    1922
    2023  /// \addtogroup galgs
     
    110113      int* number_of_augmentations;
    111114    public:
     115      typedef Node KeyType;
     116      typedef bool ValueType;
    112117      TrickyReachedMap(IntMap& _map, int& _number_of_augmentations) :
    113118        map(&_map), number_of_augmentations(&_number_of_augmentations) { }
Note: See TracChangeset for help on using the changeset viewer.