Changeset 2476:059dcdda37c5 in lemon0.x for lemon/bfs.h
 Timestamp:
 09/27/07 15:04:06 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3315
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bfs.h
r2443 r2476 594 594 /// 595 595 ///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 599 598 /// The shortest path to \c dest. 600 599 /// The distance of \c dest from the root(s). … … 616 615 /// <tt>nm[v]</tt> true. 617 616 /// 618 ///\return The reached node \c v with <tt>nm[v]< \tt> true or617 ///\return The reached node \c v with <tt>nm[v]</tt> true or 619 618 ///\c INVALID if no such node was found. 620 619 template<class NM> … … 1518 1517 /// <tt>nm[v]</tt> true. 1519 1518 /// 1520 ///\return The reached node \c v with <tt>nm[v]< \tt> true or1519 ///\return The reached node \c v with <tt>nm[v]</tt> true or 1521 1520 ///\c INVALID if no such node was found. 1522 1521 template <typename NM>
Note: See TracChangeset
for help on using the changeset viewer.