lemon/dfs.h
changeset 715 ece80147fb08
parent 584 33c6b6e755cd
child 717 684964884a2e
equal deleted inserted replaced
28:b0f97049af7b 29:f51ed04cdd7e
   409   public:
   409   public:
   410 
   410 
   411     ///\name Execution Control
   411     ///\name Execution Control
   412     ///The simplest way to execute the DFS algorithm is to use one of the
   412     ///The simplest way to execute the DFS algorithm is to use one of the
   413     ///member functions called \ref run(Node) "run()".\n
   413     ///member functions called \ref run(Node) "run()".\n
   414     ///If you need more control on the execution, first you have to call
   414     ///If you need better control on the execution, you have to call
   415     ///\ref init(), then you can add a source node with \ref addSource()
   415     ///\ref init() first, then you can add a source node with \ref addSource()
   416     ///and perform the actual computation with \ref start().
   416     ///and perform the actual computation with \ref start().
   417     ///This procedure can be repeated if there are nodes that have not
   417     ///This procedure can be repeated if there are nodes that have not
   418     ///been reached.
   418     ///been reached.
   419 
   419 
   420     ///@{
   420     ///@{
  1367   public:
  1367   public:
  1368 
  1368 
  1369     /// \name Execution Control
  1369     /// \name Execution Control
  1370     /// The simplest way to execute the DFS algorithm is to use one of the
  1370     /// The simplest way to execute the DFS algorithm is to use one of the
  1371     /// member functions called \ref run(Node) "run()".\n
  1371     /// member functions called \ref run(Node) "run()".\n
  1372     /// If you need more control on the execution, first you have to call
  1372     /// If you need better control on the execution, you have to call
  1373     /// \ref init(), then you can add a source node with \ref addSource()
  1373     /// \ref init() first, then you can add a source node with \ref addSource()
  1374     /// and perform the actual computation with \ref start().
  1374     /// and perform the actual computation with \ref start().
  1375     /// This procedure can be repeated if there are nodes that have not
  1375     /// This procedure can be repeated if there are nodes that have not
  1376     /// been reached.
  1376     /// been reached.
  1377 
  1377 
  1378     /// @{
  1378     /// @{