Changeset 1270:806451fd084b in lemon-0.x for src/lemon/bfs.h

Timestamp:

03/29/05 09:35:09 (19 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

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

Message:

bugfixes in doc

File:

• src/lemon/bfs.h (modified) (9 diffs)

src/lemon/bfs.h

@@ -136 +136 @@
   ///a Bfs traits class.
   ///
-  ///\author Jacint Szabo and Alpar Juttner
+  ///\author Alpar Juttner
   ///\todo A compare object would be nice.
 
@@ -349 +349 @@
     ///\ref named-templ-param "Named parameter"
     ///for setting the ProcessedMap type to be Graph::NodeMap<bool>.
-    ///If you don't set it explicitely, it will be automatically allocated.
+    ///If you don't set it explicitly, it will be automatically allocated.
     template <class T>
     class DefProcessedMapToBeDefaultMap :
@@ -386 +386 @@
     ///Sets the map storing the predecessor edges.
     ///If you don't use this function before calling \ref run(),
-    ///it will allocate one. The destuctor deallocates this
+    ///it will allocate one. The destructor deallocates this
     ///automatically allocated map, of course.
     ///\return <tt> (*this) </tt>
@@ -403 +403 @@
     ///Sets the map indicating the reached nodes.
     ///If you don't use this function before calling \ref run(),
-    ///it will allocate one. The destuctor deallocates this
+    ///it will allocate one. The destructor deallocates this
     ///automatically allocated map, of course.
     ///\return <tt> (*this) </tt>
@@ -420 +420 @@
     ///Sets the map indicating the processed nodes.
     ///If you don't use this function before calling \ref run(),
-    ///it will allocate one. The destuctor deallocates this
+    ///it will allocate one. The destructor deallocates this
     ///automatically allocated map, of course.
     ///\return <tt> (*this) </tt>
@@ -437 +437 @@
 //     ///Sets the map storing the predecessor nodes.
 //     ///If you don't use this function before calling \ref run(),
-//     ///it will allocate one. The destuctor deallocates this
+//     ///it will allocate one. The destructor deallocates this
 //     ///automatically allocated map, of course.
 //     ///\return <tt> (*this) </tt>
@@ -454 +454 @@
     ///Sets the map storing the distances calculated by the algorithm.
     ///If you don't use this function before calling \ref run(),
-    ///it will allocate one. The destuctor deallocates this
+    ///it will allocate one. The destructor deallocates this
     ///automatically allocated map, of course.
     ///\return <tt> (*this) </tt>
@@ -659 +659 @@
     ///\pre \ref run() must be called before using this function.
     ///\warning If node \c v in unreachable from the root(s) the return value
-    ///of this funcion is undefined.
+    ///of this function is undefined.
     int dist(Node v) const { return (*_dist)[v]; }
 
@@ -716 +716 @@
 
     ///Returns \c true if \c v is reachable from the root.
-    ///\warning The source nodes are inditated as unreached.
+    ///\warning The source nodes are indicated as unreached.
     ///\pre Either \ref run() or \ref start()
     ///must be called before using this function.