COIN-OR::LEMON - Graph Library

Changeset 291:65460cbf9e90 in lemon-0.x for src/work


Ignore:
Timestamp:
04/05/04 13:55:01 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@409
Message:

Mukodik a Suurballe

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/suurballe.h

    r276 r291  
    2828    public :
    2929      typedef int ValueType;
     30      typedef typename Graph::Edge KeyType;
     31
    3032      int operator[](typename Graph::Edge e) const {
    3133        return 1;
     
    5961    typedef typename Graph::Edge Edge;
    6062    typedef typename Graph::OutEdgeIt OutEdgeIt;
    61     typedef ResGraphWrapper< Graph,T,typename Graph::EdgeMap<int>, ConstMap > ResGraphType;
     63    typedef TrivGraphWrapper<const Graph> TrivGraphType;
     64    typedef ResGraphWrapper<TrivGraphType,int,typename Graph::EdgeMap<int>,
     65      ConstMap> ResGraphType;
    6266
    6367    const Graph& G;
     
    8387      ConstMap const1map;
    8488      //ResGraphWrapper< Graph,T,typename Graph::EdgeMap<int>, ConstMap>
    85       ResGraphType res_graph(G, reversed, const1map);
     89      TrivGraphType ize(G);
     90      ResGraphType res_graph(ize, reversed, const1map);
    8691      //ModLengthMap modified_length(length, dijkstra_dist);
    8792      //Dijkstra<ResGraphType, ModLengthMap> dijkstra(res_graph, modified_length);
     
    110115        Edge e;
    111116        while (n!=s){
    112           e=dijkstra.pred(n);
    113           n=dijkstra.predNode(n);
     117          e = dijkstra.pred(n);
     118          n = dijkstra.predNode(n);
    114119          reversed[e] = 1-reversed[e];
    115120        }
Note: See TracChangeset for help on using the changeset viewer.