1.1 --- a/lemon/bfs.h Thu Jun 11 23:13:24 2009 +0200
1.2 +++ b/lemon/bfs.h Fri Jul 24 10:27:40 2009 +0200
1.3 @@ -413,8 +413,8 @@
1.4 ///\name Execution Control
1.5 ///The simplest way to execute the BFS algorithm is to use one of the
1.6 ///member functions called \ref run(Node) "run()".\n
1.7 - ///If you need more control on the execution, first you have to call
1.8 - ///\ref init(), then you can add several source nodes with
1.9 + ///If you need better control on the execution, you have to call
1.10 + ///\ref init() first, then you can add several source nodes with
1.11 ///\ref addSource(). Finally the actual path computation can be
1.12 ///performed with one of the \ref start() functions.
1.13
1.14 @@ -1425,8 +1425,8 @@
1.15 /// \name Execution Control
1.16 /// The simplest way to execute the BFS algorithm is to use one of the
1.17 /// member functions called \ref run(Node) "run()".\n
1.18 - /// If you need more control on the execution, first you have to call
1.19 - /// \ref init(), then you can add several source nodes with
1.20 + /// If you need better control on the execution, you have to call
1.21 + /// \ref init() first, then you can add several source nodes with
1.22 /// \ref addSource(). Finally the actual path computation can be
1.23 /// performed with one of the \ref start() functions.
1.24