1.1 --- a/src/work/athos/minlengthpaths.h	Thu Apr 15 08:06:43 2004 +0000
     1.2 +++ b/src/work/athos/minlengthpaths.h	Thu Apr 15 14:41:20 2004 +0000
     1.3 @@ -37,7 +37,7 @@
     1.4  
     1.5      typedef ConstMap<Edge,int> ConstMap;
     1.6  
     1.7 -    typedef ResGraphWrapper<const Graph,int,EdgeIntMap,ConstMap> ResGraphType;
     1.8 +    typedef ResGraphWrapper<const Graph,int,ConstMap,EdgeIntMap> ResGraphType;
     1.9  
    1.10  
    1.11      class ModLengthMap {   
    1.12 @@ -92,7 +92,7 @@
    1.13        ConstMap const1map(1);
    1.14  
    1.15        //We need a residual graph, in which some of the edges are reversed
    1.16 -      ResGraphType res_graph(G, reversed, const1map);
    1.17 +      ResGraphType res_graph(G, const1map, reversed);
    1.18  
    1.19        //Initialize the copy of the Dijkstra potential to zero
    1.20        typename ResGraphType::NodeMap<Length> dijkstra_dist(res_graph);