COIN-OR::LEMON - Graph Library

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

technical corrections

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/bipartite_matching_try.cc

    r642 r762  
    99//#include <dimacs.h>
    1010#include <hugo/time_measure.h>
    11 #include <hugo/for_each_macros.h>
     11#include <for_each_macros.h>
    1212#include <bfs_dfs.h>
    1313#include <hugo/graph_wrapper.h>
    1414#include <bipartite_graph_wrapper.h>
    1515#include <hugo/maps.h>
    16 #include <max_flow.h>
     16#include <hugo/max_flow.h>
     17#include <augmenting_flow.h>
    1718
    1819/**
     
    164165  ts.reset();
    165166  stGW::EdgeMap<int> max_flow(stgw);
    166   MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
     167  AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
    167168    max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, max_flow);
    168169//  while (max_flow_test.augmentOnShortestPath()) { }
Note: See TracChangeset for help on using the changeset viewer.