Changeset 1130:0759d974de81 in lemon-main for lemon/bellman_ford.h

Timestamp:

01/05/14 22:24:56 (10 years ago)

Author:

Gabor Gevay <ggab90@…>

Branch:

default

Phase:

public

Message:

STL style iterators (#325)

For

• graph types,
• graph adaptors,
• paths,
• iterable maps,
• LP rows/cols and
• active nodes is BellmanFord?

File:

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

lemon/bellman_ford.h

@@ -30 +30 @@
 #include <lemon/maps.h>
 #include <lemon/path.h>
+#include <lemon/bits/stl_iterators.h>
 
 #include <limits>
@@ -690 +691 @@
       int _index;
     };
+
+    /// \brief Gets the collection of the active nodes.
+    ///
+    /// This function can be used for iterating on the active nodes of the
+    /// Bellman-Ford algorithm after the last phase.
+    /// These nodes should be checked in the next phase to
+    /// find augmenting arcs outgoing from them.
+    /// It returns a wrapped ActiveIt, which looks
+    /// like an STL container (by having begin() and end())
+    /// which you can use in range-based for loops, STL algorithms, etc.
+    LemonRangeWrapper1<ActiveIt, BellmanFord>
+        activeNodes(const BellmanFord& algorithm) const {
+      return LemonRangeWrapper1<ActiveIt, BellmanFord>(algorithm);
+    }
+
 
     /// \name Query Functions