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

Timestamp:

04/05/04 13:55:01 (21 years ago)

Author:

athos

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@409

Message:

Mukodik a Suurballe

File:

• src/work/athos/suurballe.h (modified) (4 diffs)

src/work/athos/suurballe.h

@@ -28 +28 @@
     public :
       typedef int ValueType;
+      typedef typename Graph::Edge KeyType;
+
       int operator[](typename Graph::Edge e) const { 
         return 1;
@@ -59 +61 @@
     typedef typename Graph::Edge Edge;
     typedef typename Graph::OutEdgeIt OutEdgeIt;
-    typedef ResGraphWrapper< Graph,T,typename Graph::EdgeMap<int>, ConstMap > ResGraphType;
+    typedef TrivGraphWrapper<const Graph> TrivGraphType;
+    typedef ResGraphWrapper<TrivGraphType,int,typename Graph::EdgeMap<int>,
+      ConstMap> ResGraphType;
 
     const Graph& G;
@@ -83 +87 @@
       ConstMap const1map;
       //ResGraphWrapper< Graph,T,typename Graph::EdgeMap<int>, ConstMap> 
-      ResGraphType res_graph(G, reversed, const1map);
+      TrivGraphType ize(G);
+      ResGraphType res_graph(ize, reversed, const1map);
       //ModLengthMap modified_length(length, dijkstra_dist);
       //Dijkstra<ResGraphType, ModLengthMap> dijkstra(res_graph, modified_length);
@@ -110 +115 @@
         Edge e;
         while (n!=s){
-          e=dijkstra.pred(n);
-          n=dijkstra.predNode(n);
+          e = dijkstra.pred(n);
+          n = dijkstra.predNode(n);
           reversed[e] = 1-reversed[e];
         }