Changeset 2443:14abfa02bf42 in lemon-0.x for lemon/dfs.h

Timestamp:

05/11/07 18:02:53 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

Patch for retrieving reached/processed node in dijkstra, bfs and dfs

Patch from Peter Kovacs

File:

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

lemon/dfs.h

@@ -565 +565 @@
     ///
     ///\param em must be a bool (or convertible) edge map. The algorithm
-    ///will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
-    ///
-    ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
+    ///will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
+    ///
+    ///\return The reached edge \c e with <tt>em[e]<\tt> true or
     ///\c INVALID if no such edge was found.
     ///
@@ -1459 +1459 @@
     ///
     /// \param em must be a bool (or convertible) edge map. The algorithm
-    /// will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
-    ///
-    ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
+    /// will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
+    ///
+    ///\return The reached edge \c e with <tt>em[e]<\tt> true or
     ///\c INVALID if no such edge was found.
     ///