COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dfs.h

    r716 r717  
    413413    ///The simplest way to execute the DFS algorithm is to use one of the
    414414    ///member functions called \ref run(Node) "run()".\n
    415     ///If you need more control on the execution, first you have to call
    416     ///\ref init(), then you can add a source node with \ref addSource()
     415    ///If you need better control on the execution, you have to call
     416    ///\ref init() first, then you can add a source node with \ref addSource()
    417417    ///and perform the actual computation with \ref start().
    418418    ///This procedure can be repeated if there are nodes that have not
     
    13651365    /// The simplest way to execute the DFS algorithm is to use one of the
    13661366    /// member functions called \ref run(Node) "run()".\n
    1367     /// If you need more control on the execution, first you have to call
    1368     /// \ref init(), then you can add a source node with \ref addSource()
     1367    /// If you need better control on the execution, you have to call
     1368    /// \ref init() first, then you can add a source node with \ref addSource()
    13691369    /// and perform the actual computation with \ref start().
    13701370    /// This procedure can be repeated if there are nodes that have not
Note: See TracChangeset for help on using the changeset viewer.