1.1 --- a/lemon/dfs.h Sun Aug 02 12:40:20 2009 +0200
1.2 +++ b/lemon/dfs.h Fri Sep 25 09:13:03 2009 +0200
1.3 @@ -412,8 +412,8 @@
1.4 ///\name Execution Control
1.5 ///The simplest way to execute the DFS 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 a source node with \ref addSource()
1.9 + ///If you need better control on the execution, you have to call
1.10 + ///\ref init() first, then you can add a source node with \ref addSource()
1.11 ///and perform the actual computation with \ref start().
1.12 ///This procedure can be repeated if there are nodes that have not
1.13 ///been reached.
1.14 @@ -1364,8 +1364,8 @@
1.15 /// \name Execution Control
1.16 /// The simplest way to execute the DFS 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 a source node with \ref addSource()
1.20 + /// If you need better control on the execution, you have to call
1.21 + /// \ref init() first, then you can add a source node with \ref addSource()
1.22 /// and perform the actual computation with \ref start().
1.23 /// This procedure can be repeated if there are nodes that have not
1.24 /// been reached.