Changeset 1345:71e0777b65e0 in lemon-0.x

Timestamp:

04/12/05 19:37:22 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Minor changes.

File:

• src/lemon/dijkstra.h (modified) (2 diffs)

src/lemon/dijkstra.h

@@ -600 +600 @@
     ///\param nm must be a bool (or convertible) node map. The algorithm
     ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>.
-    template<class NM>
-    void start(const NM &nm)
+    template<class NodeBoolMap>
+    void start(const NodeBoolMap &nm)
     {
       while ( !_heap.empty() && !nm[_heap.top()] ) processNextNode();
@@ -955 +955 @@
       if(Base::_source==INVALID) throw UninitializedParameter();
       Dijkstra<Graph,LengthMap,TR> 
-        Dij(*(Graph*)Base::_g,*(LengthMap*)Base::_length);
-      if(Base::_pred) Dij.predMap(*(PredMap*)Base::_pred);
+        dij(*(Graph*)Base::_g,*(LengthMap*)Base::_length);
+      if(Base::_pred) dij.predMap(*(PredMap*)Base::_pred);
 //       if(Base::_predNode) Dij.predNodeMap(*(PredNodeMap*)Base::_predNode);
-      if(Base::_dist) Dij.distMap(*(DistMap*)Base::_dist);
-      Dij.run(Base::_source);
+      if(Base::_dist) dij.distMap(*(DistMap*)Base::_dist);
+      dij.run(Base::_source);
     }