COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/19/04 18:20:10 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@848
Message:

for_each fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/leda/bipartite_matching_leda.cc

    r616 r648  
    1111
    1212#include <leda_graph_wrapper.h>
    13 #include <list_graph.h>
     13#include <sage_graph.h>
    1414//#include <smart_graph.h>
    1515//#include <dimacs.h>
    1616#include <hugo/time_measure.h>
    17 #include <for_each_macros.h>
     17#include <hugo/for_each_macros.h>
    1818#include <hugo/graph_wrapper.h>
    1919#include <bipartite_graph_wrapper.h>
     
    5252  Graph g(lg);
    5353
    54   //for UndirListGraph
    55   //typedef UndirListGraph Graph;
     54  //for UndirSageGraph
     55  //typedef UndirSageGraph Graph;
    5656  //Graph g;
    5757
     
    108108  FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
    109109//  while (max_flow_test.augmentOnShortestPath()) { }
    110   typedef ListGraph MutableGraph;
     110  typedef SageGraph MutableGraph;
    111111//  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
    112112  while (max_flow_test.augmentOnBlockingFlow2()) {
Note: See TracChangeset for help on using the changeset viewer.