1.1 --- a/src/include/dijkstra.h	Wed Apr 28 12:58:58 2004 +0000
     1.2 +++ b/src/include/dijkstra.h	Wed Apr 28 14:17:54 2004 +0000
     1.3 @@ -68,7 +68,7 @@
     1.4      
     1.5    public :
     1.6      
     1.7 -    Dijkstra(Graph& _G, LengthMap& _length) :
     1.8 +    Dijkstra(const Graph& _G, const LengthMap& _length) :
     1.9        G(_G), length(_length), predecessor(_G), pred_node(_G), distance(_G) { }
    1.10      
    1.11      void run(Node s);

     2.1 --- a/src/work/marci/leda/bipartite_matching_leda.cc	Wed Apr 28 12:58:58 2004 +0000
     2.2 +++ b/src/work/marci/leda/bipartite_matching_leda.cc	Wed Apr 28 14:17:54 2004 +0000
     2.3 @@ -121,7 +121,7 @@
     2.4    ts.reset();
     2.5    stGW::EdgeMap<int> pre_flow(stgw);
     2.6    Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
     2.7 -    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow, true);
     2.8 +    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, pre_flow/*, true*/);
     2.9    pre_flow_test.run();
    2.10    std::cout << "pre flow value: " << max_flow_test.flowValue() << std::endl;
    2.11    std::cout << "elapsed time: " << ts << std::endl;

     3.1 --- a/src/work/marci/leda/bipartite_matching_leda_gen.cc	Wed Apr 28 12:58:58 2004 +0000
     3.2 +++ b/src/work/marci/leda/bipartite_matching_leda_gen.cc	Wed Apr 28 14:17:54 2004 +0000
     3.3 @@ -116,7 +116,7 @@
     3.4    ts.reset();
     3.5    //  stGW::EdgeMap<int> pre_flow(stgw);
     3.6    Preflow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> > 
     3.7 -    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow, true);
     3.8 +    pre_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
     3.9    pre_flow_test.run();
    3.10    std::cout << "HUGO pre flow value: " << pre_flow_test.flowValue() << std::endl;
    3.11    std::cout << "elapsed time: " << ts << std::endl;