1.1 --- a/src/work/marci/bipartite_matching_try.cc	Fri May 14 18:08:29 2004 +0000
     1.2 +++ b/src/work/marci/bipartite_matching_try.cc	Fri May 14 18:28:57 2004 +0000
     1.3 @@ -4,7 +4,7 @@
     1.4  #include <vector>
     1.5  #include <cstdlib>
     1.6  
     1.7 -#include <list_graph.h>
     1.8 +#include <sage_graph.h>
     1.9  //#include <smart_graph.h>
    1.10  //#include <dimacs.h>
    1.11  #include <hugo/time_measure.h>
    1.12 @@ -40,7 +40,7 @@
    1.13  using namespace hugo;
    1.14  
    1.15  int main() {
    1.16 -  typedef UndirListGraph Graph; 
    1.17 +  typedef UndirSageGraph Graph; 
    1.18    typedef Graph::Node Node;
    1.19    typedef Graph::NodeIt NodeIt;
    1.20    typedef Graph::Edge Edge;
    1.21 @@ -166,7 +166,7 @@
    1.22    MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
    1.23      max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, max_flow);
    1.24  //  while (max_flow_test.augmentOnShortestPath()) { }
    1.25 -  typedef ListGraph MutableGraph;
    1.26 +  typedef SageGraph MutableGraph;
    1.27  //  while (max_flow_test.augmentOnBlockingFlow1<MutableGraph>()) {
    1.28    while (max_flow_test.augmentOnBlockingFlow2()) {
    1.29     std::cout << max_flow_test.flowValue() << std::endl;