COIN-OR::LEMON - Graph Library

Changeset 2476:059dcdda37c5 in lemon-0.x for lemon/bfs.h


Ignore:
Timestamp:
09/27/07 15:04:06 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3315
Message:

Bug fixes in the documentation (mainly bad references).

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bfs.h

    r2443 r2476  
    594594    ///
    595595    ///This method runs the %BFS algorithm from the root node(s)
    596     ///in order to
    597     ///compute the
    598     ///shortest path to \c dest. The algorithm computes
     596    ///in order to compute the shortest path to \c dest.
     597    ///The algorithm computes
    599598    ///- The shortest path to \c  dest.
    600599    ///- The distance of \c dest from the root(s).
     
    616615    /// <tt>nm[v]</tt> true.
    617616    ///
    618     ///\return The reached node \c v with <tt>nm[v]<\tt> true or
     617    ///\return The reached node \c v with <tt>nm[v]</tt> true or
    619618    ///\c INVALID if no such node was found.
    620619    template<class NM>
     
    15181517    /// <tt>nm[v]</tt> true.
    15191518    ///
    1520     ///\return The reached node \c v with <tt>nm[v]<\tt> true or
     1519    ///\return The reached node \c v with <tt>nm[v]</tt> true or
    15211520    ///\c INVALID if no such node was found.
    15221521    template <typename NM>
Note: See TracChangeset for help on using the changeset viewer.