1.1 --- a/lemon/min_cost_arborescence.h	Thu Jun 11 23:13:24 2009 +0200
     1.2 +++ b/lemon/min_cost_arborescence.h	Fri Jul 24 10:27:40 2009 +0200
     1.3 @@ -488,8 +488,8 @@
     1.4      /// \name Execution Control
     1.5      /// The simplest way to execute the algorithm is to use
     1.6      /// one of the member functions called \c run(...). \n
     1.7 -    /// If you need more control on the execution,
     1.8 -    /// first you must call \ref init(), then you can add several
     1.9 +    /// If you need better control on the execution,
    1.10 +    /// you have to call \ref init() first, then you can add several
    1.11      /// source nodes with \ref addSource().
    1.12      /// Finally \ref start() will perform the arborescence
    1.13      /// computation.