Changeset 2476:059dcdda37c5 in lemon-0.x for lemon/bfs.h

Timestamp:

09/27/07 15:04:06 (17 years ago)

Author:

Peter Kovacs

Branch:

default

Phase:

public

Convert:

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

Message:

Bug fixes in the documentation (mainly bad references).

File:

• lemon/bfs.h (modified) (3 diffs)

lemon/bfs.h

@@ -594 +594 @@
     ///
     ///This method runs the %BFS algorithm from the root node(s)
-    ///in order to
-    ///compute the
-    ///shortest path to \c dest. The algorithm computes
+    ///in order to compute the shortest path to \c dest.
+    ///The algorithm computes
     ///- The shortest path to \c  dest.
     ///- The distance of \c dest from the root(s).
@@ -616 +615 @@
     /// <tt>nm[v]</tt> true.
     ///
-    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
+    ///\return The reached node \c v with <tt>nm[v]</tt> true or
     ///\c INVALID if no such node was found.
     template<class NM>
@@ -1518 +1517 @@
     /// <tt>nm[v]</tt> true.
     ///
-    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
+    ///\return The reached node \c v with <tt>nm[v]</tt> true or
     ///\c INVALID if no such node was found.
     template <typename NM>