Changeset 1763:49045f2d28d4 in lemon0.x for lemon/belmann_ford.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/belmann_ford.h
r1754 r1763 504 504 p.clear(); 505 505 typename Path::Builder b(p); 506 for(b.setStartNode(t);pred (t)!=INVALID;t=predNode(t))507 b.pushFront(pred (t));506 for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t)) 507 b.pushFront(predEdge(t)); 508 508 b.commit(); 509 509 return true; … … 530 530 /// this function. 531 531 /// \todo predEdge could be a better name. 532 Edge pred (Node v) const { return (*_pred)[v]; }532 Edge predEdge(Node v) const { return (*_pred)[v]; } 533 533 534 534 /// \brief Returns the 'previous node' of the shortest path tree. … … 538 538 /// the root to \c /v. It is INVALID if \c v is unreachable from the root 539 539 /// or if \c v=s. The shortest path tree used here is equal to the 540 /// shortest path tree used in \ref pred (). \pre \ref run() must be540 /// shortest path tree used in \ref predEdge(). \pre \ref run() must be 541 541 /// called before using this function. 542 542 Node predNode(Node v) const {
Note: See TracChangeset
for help on using the changeset viewer.