COIN-OR::LEMON - Graph Library

Changeset 2443:14abfa02bf42 in lemon-0.x for lemon/dijkstra.h


Ignore:
Timestamp:
05/11/07 18:02:53 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3280
Message:

Patch for retrieving reached/processed node in dijkstra, bfs and dfs

Patch from Peter Kovacs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dijkstra.h

    r2439 r2443  
    664664    ///
    665665    ///\param nm must be a bool (or convertible) node map. The algorithm
    666     ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>.
    667     ///
    668     ///\return The reached node \c v with <tt>nm[v]==true<\tt> or
     666    ///will stop when it reaches a node \c v with <tt>nm[v]</tt> true.
     667    ///
     668    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
    669669    ///\c INVALID if no such node was found.
    670670    template<class NodeBoolMap>
Note: See TracChangeset for help on using the changeset viewer.