lemon/dfs.h
changeset 733 abf31e4af617
parent 716 f47b6c94577e
parent 713 4ac30454f1c1
child 786 e20173729589
child 787 c2230649a493
equal deleted inserted replaced
30:174ef3f7715b 31:8365ef30621f
   410   public:
   410   public:
   411 
   411 
   412     ///\name Execution Control
   412     ///\name Execution Control
   413     ///The simplest way to execute the DFS algorithm is to use one of the
   413     ///The simplest way to execute the DFS algorithm is to use one of the
   414     ///member functions called \ref run(Node) "run()".\n
   414     ///member functions called \ref run(Node) "run()".\n
   415     ///If you need more control on the execution, first you have to call
   415     ///If you need better control on the execution, you have to call
   416     ///\ref init(), then you can add a source node with \ref addSource()
   416     ///\ref init() first, then you can add a source node with \ref addSource()
   417     ///and perform the actual computation with \ref start().
   417     ///and perform the actual computation with \ref start().
   418     ///This procedure can be repeated if there are nodes that have not
   418     ///This procedure can be repeated if there are nodes that have not
   419     ///been reached.
   419     ///been reached.
   420 
   420 
   421     ///@{
   421     ///@{
  1362   public:
  1362   public:
  1363 
  1363 
  1364     /// \name Execution Control
  1364     /// \name Execution Control
  1365     /// The simplest way to execute the DFS algorithm is to use one of the
  1365     /// The simplest way to execute the DFS algorithm is to use one of the
  1366     /// member functions called \ref run(Node) "run()".\n
  1366     /// member functions called \ref run(Node) "run()".\n
  1367     /// If you need more control on the execution, first you have to call
  1367     /// If you need better control on the execution, you have to call
  1368     /// \ref init(), then you can add a source node with \ref addSource()
  1368     /// \ref init() first, then you can add a source node with \ref addSource()
  1369     /// and perform the actual computation with \ref start().
  1369     /// and perform the actual computation with \ref start().
  1370     /// This procedure can be repeated if there are nodes that have not
  1370     /// This procedure can be repeated if there are nodes that have not
  1371     /// been reached.
  1371     /// been reached.
  1372 
  1372 
  1373     /// @{
  1373     /// @{