Changeset 1734:2fb5ceac10e7 in lemon-0.x for lemon/dijkstra.h

Timestamp:

10/24/05 10:09:59 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• dijkstraZero() added. (Until we conclude how to handle the related problem.)
• processed() query function added.

File:

• lemon/dijkstra.h (modified) (5 diffs)

lemon/dijkstra.h

@@ -23 +23 @@
 ///
 ///\todo getPath() should be implemented! (also for BFS and DFS)
+///\todo dijkstraZero() solution should be revised.
 
 #include <lemon/list_graph.h>
@@ -32 +33 @@
 namespace lemon {
 
-
+  template<class T> T dijkstraZero() {return 0;}
   
   ///Default traits class of Dijkstra class.
@@ -500 +501 @@
     ///It is pushed to the heap only if either it was not in the heap
     ///or the shortest path found till then is longer then \c dst.
-    void addSource(Node s,Value dst=0)
+    void addSource(Node s,Value dst=dijkstraZero<Value>())
     {
       if(_heap->state(s) != Heap::IN_HEAP) {
@@ -660 +661 @@
       addSource(s);
       start(t);
-      return (*_pred)[t]==INVALID?0:(*_dist)[t];
+      return (*_pred)[t]==INVALID?dijkstraZero<Value>():(*_dist)[t];
     }
     
@@ -747 +748 @@
     ///
     bool reached(Node v) { return (*_heap_cross_ref)[v] != Heap::PRE_HEAP; }
+
+    ///Checks if a node is processed.
+
+    ///Returns \c true if \c v is processed, i.e. the shortest
+    ///path to \c v has already found.
+    ///\pre \ref run() must be called before using this function.
+    ///
+    bool processed(Node v) { return (*_heap_cross_ref)[v] == Heap::POST_HEAP; }
     
     ///@}