1.1 --- a/lemon/dijkstra.h Sun Aug 02 12:40:20 2009 +0200
1.2 +++ b/lemon/dijkstra.h Fri Sep 25 09:13:03 2009 +0200
1.3 @@ -589,8 +589,8 @@
1.4 ///\name Execution Control
1.5 ///The simplest way to execute the %Dijkstra algorithm is to use
1.6 ///one of the 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