1.1 --- a/src/work/alpar/f_ed_ka_demo.cc	Fri Feb 20 21:59:34 2004 +0000
     1.2 +++ b/src/work/alpar/f_ed_ka_demo.cc	Fri Feb 20 22:01:02 2004 +0000
     1.3 @@ -8,14 +8,14 @@
     1.4  #include "f_ed_ka.h"
     1.5  #include "../marci/time_measure.h"
     1.6  
     1.7 -using namespace marci;
     1.8 +using namespace hugo;
     1.9  
    1.10  // Use a DIMACS max flow file as stdin.
    1.11  // read_dimacs_demo < dimacs_max_flow_file
    1.12  
    1.13  int main(int, char **) {
    1.14 -  //  typedef SmartGraph Graph;
    1.15 -  typedef ListGraph Graph;
    1.16 +  typedef SmartGraph Graph;
    1.17 +  //typedef ListGraph Graph;
    1.18  
    1.19    typedef Graph::NodeIt NodeIt;
    1.20    typedef Graph::EachNodeIt EachNodeIt;
    1.21 @@ -23,11 +23,11 @@
    1.22  
    1.23    Graph G;
    1.24    NodeIt s, t;
    1.25 -  Graph::EdgeMap<int> cap(G);
    1.26 +  Graph::DynEdgeMap<int> cap(G);
    1.27    readDimacsMaxFlow(std::cin, G, s, t, cap);
    1.28  
    1.29    std::cout << "edmonds karp demo..." << std::endl;
    1.30 -  Graph::EdgeMap<int> flow(G); //0 flow
    1.31 +  Graph::DynEdgeMap<int> flow(G); //0 flow
    1.32    
    1.33    int ret;
    1.34    double pre_time=currTime();