Changeset 296:09d6d48815a5 in lemon-0.x for src/include/dijkstra.h

Timestamp:

04/05/04 15:55:55 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Swept out some deprecated comments

File:

• src/include/dijkstra.h (modified) (5 diffs)

src/include/dijkstra.h

@@ -70 +70 @@
             typename LengthMap=typename Graph::EdgeMap<int>,
             template <class,class,class> class Heap = BinHeap >
-//          typename Heap=BinHeap <typename Graph::Node,
-//                                 typename LengthMap::ValueType, 
-//                                 typename Graph::NodeMap<int> > >
 #endif
   class Dijkstra{
@@ -90 +87 @@
     const LengthMap& length;
     PredMap predecessor;
-    //In place of reach:
     PredNodeMap pred_node;
     DistMap distance;
-    //I don't like this:
-    //     //FIXME:
-    //     typename Graph::NodeMap<bool> reach;
-    //     //typename Graph::NodeMap<int> reach;
     
   public :
     
-    /*
-      The distance of the nodes is 0.
-    */
     Dijkstra(Graph& _G, LengthMap& _length) :
       G(_G), length(_length), predecessor(_G), pred_node(_G), distance(_G) { }
@@ -147 +136 @@
     ///\pre \ref run() must be called before using this function.
     const PredNodeMap &predNodeMap() const { return pred_node;}
-
-    //    bool reached(Node v) { return reach[v]; }
 
     ///Checks if a node is reachable from the source.
@@ -187 +174 @@
     }
     
-    //We don't need it at all.
-    //     //FIXME:
-    //     typename Graph::NodeMap<bool> scanned(G,false);
-    //     //typename Graph::NodeMap<int> scanned(G,false);
     typename Graph::NodeMap<int> heap_map(G,-1);
     
-    //Heap heap(heap_map);
     Heap<Node,ValueType,typename Graph::NodeMap<int> > heap(heap_map);
     
     heap.push(s,0); 
-    //    reach.set(s, true);
     
       while ( !heap.empty() ) {
@@ -212 +193 @@
           switch(heap.state(w)) {
           case heap.PRE_HEAP:
-            //      reach.set(w,true);
             heap.push(w,oldvalue+length[e]); 
             predecessor.set(w,e);