Changeset 291:65460cbf9e90 in lemon0.x for src/work/athos
 Timestamp:
 04/05/04 13:55:01 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@409
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/athos/suurballe.h
r276 r291 28 28 public : 29 29 typedef int ValueType; 30 typedef typename Graph::Edge KeyType; 31 30 32 int operator[](typename Graph::Edge e) const { 31 33 return 1; … … 59 61 typedef typename Graph::Edge Edge; 60 62 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; 62 66 63 67 const Graph& G; … … 83 87 ConstMap const1map; 84 88 //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); 86 91 //ModLengthMap modified_length(length, dijkstra_dist); 87 92 //Dijkstra<ResGraphType, ModLengthMap> dijkstra(res_graph, modified_length); … … 110 115 Edge e; 111 116 while (n!=s){ 112 e =dijkstra.pred(n);113 n =dijkstra.predNode(n);117 e = dijkstra.pred(n); 118 n = dijkstra.predNode(n); 114 119 reversed[e] = 1reversed[e]; 115 120 }
Note: See TracChangeset
for help on using the changeset viewer.