lemon/min_cost_arborescence.h
changeset 771 8452ca46e29a
parent 625 029a48052c67
child 825 75e6020b19b1
equal deleted inserted replaced
4:4fbe5ce76d8b 5:dc6cf386ff66
   486     }
   486     }
   487 
   487 
   488     /// \name Execution Control
   488     /// \name Execution Control
   489     /// The simplest way to execute the algorithm is to use
   489     /// The simplest way to execute the algorithm is to use
   490     /// one of the member functions called \c run(...). \n
   490     /// one of the member functions called \c run(...). \n
   491     /// If you need more control on the execution,
   491     /// If you need better control on the execution,
   492     /// first you must call \ref init(), then you can add several
   492     /// you have to call \ref init() first, then you can add several
   493     /// source nodes with \ref addSource().
   493     /// source nodes with \ref addSource().
   494     /// Finally \ref start() will perform the arborescence
   494     /// Finally \ref start() will perform the arborescence
   495     /// computation.
   495     /// computation.
   496 
   496 
   497     ///@{
   497     ///@{