1.1 --- a/test/min_cost_flow_test.cc	Mon Oct 30 16:26:13 2006 +0000
     1.2 +++ b/test/min_cost_flow_test.cc	Mon Oct 30 17:22:14 2006 +0000
     1.3 @@ -19,7 +19,7 @@
     1.4  #include <iostream>
     1.5  #include "test_tools.h"
     1.6  #include <lemon/list_graph.h>
     1.7 -#include <lemon/min_cost_flow.h>
     1.8 +#include <lemon/ssp_min_cost_flow.h>
     1.9  //#include <path.h>
    1.10  //#include <maps.h>
    1.11  
    1.12 @@ -92,7 +92,7 @@
    1.13    //  ConstMap<Edge, int> const1map(1);
    1.14    std::cout << "Mincostflows algorithm test..." << std::endl;
    1.15  
    1.16 -  MinCostFlow< Graph, Graph::EdgeMap<int>, Graph::EdgeMap<int> >
    1.17 +  SspMinCostFlow< Graph, Graph::EdgeMap<int>, Graph::EdgeMap<int> >
    1.18      surb_test(graph, length, capacity, s, t);
    1.19  
    1.20    int k=1;