Changeset 1857:2e3a4481901e in lemon-0.x

Timestamp:

12/10/05 20:38:53 (19 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

belmann_ford:

• run() with length limit
• bugfix in processNextRound()

File:

• lemon/belmann_ford.h (modified) (2 diffs)

lemon/belmann_ford.h

@@ -431 +431 @@
       std::vector<Value> values(_process.size());
       for (int i = 0; i < (int)_process.size(); ++i) {
-        values[i] = _dist[_process[i]];
+        values[i] = (*_dist)[_process[i]];
       }
       for (int i = 0; i < (int)_process.size(); ++i) {
@@ -554 +554 @@
       addSource(s);
       start();
+    }
+    
+    /// \brief Runs %BelmannFord algorithm with limited path length 
+    /// from node \c s.
+    ///    
+    /// This method runs the %BelmannFord algorithm from a root node \c s
+    /// in order to compute the shortest path with at most \c len edges 
+    /// to each node. The algorithm computes
+    /// - The shortest path tree.
+    /// - The distance of each node from the root.
+    ///
+    /// \note d.run(s, len) is just a shortcut of the following code.
+    /// \code
+    ///  d.init();
+    ///  d.addSource(s);
+    ///  d.limitedStart(len);
+    /// \endcode
+    void run(Node s, int len) {
+      init();
+      addSource(s);
+      limitedStart(len);
     }