Changeset 1763:49045f2d28d4 in lemon0.x for lemon/dijkstra.h
 Timestamp:
 11/04/05 15:48:10 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2295
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dijkstra.h
r1761 r1763 734 734 p.clear(); 735 735 typename P::Builder b(p); 736 for(b.setStartNode(t);pred (t)!=INVALID;t=predNode(t))737 b.pushFront(pred (t));736 for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t)) 737 b.pushFront(predEdge(t)); 738 738 b.commit(); 739 739 return true; … … 760 760 ///this function. 761 761 ///\todo predEdge could be a better name. 762 Edge pred (Node v) const { return (*_pred)[v]; }762 Edge predEdge(Node v) const { return (*_pred)[v]; } 763 763 764 764 ///Returns the 'previous node' of the shortest path tree. … … 768 768 ///root to \c /v. It is INVALID if \c v is unreachable from the root or if 769 769 ///\c v=s. The shortest path tree used here is equal to the shortest path 770 ///tree used in \ref pred (). \pre \ref run() must be called before770 ///tree used in \ref predEdge(). \pre \ref run() must be called before 771 771 ///using this function. 772 772 Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
Note: See TracChangeset
for help on using the changeset viewer.