lemon-0.x: comparison lemon/bfs.h

equal deleted inserted replaced

-:f063e233ca99
+:5ea96e6a517f
 bool getPath(P &p,Node t)
 {
 if(reached(t)) {
 	p.clear();
 	typename P::Builder b(p);
-	for(b.setStartNode(t);pred(t)!=INVALID;t=predNode(t))
+	for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))
-	  b.pushFront(pred(t));
+	  b.pushFront(predEdge(t));
 	b.commit();
 	return true;
 }
 return false;
 }
 ///shortest path tree used here is equal to the shortest path tree used in
 ///\ref predNode().
 ///\pre Either \ref run() or \ref start() must be called before using
 ///this function.
 ///\todo predEdge could be a better name.
-Edge pred(Node v) const { return (*_pred)[v];}
+Edge predEdge(Node v) const { return (*_pred)[v];}
 ///Returns the 'previous node' of the shortest path tree.
 ///For a node \c v it returns the 'previous node'
 ///of the shortest path tree,
 ///i.e. it returns the last but one node from a shortest path from the
 ///root(a) to \c /v.
 ///It is INVALID if \c v is unreachable from the root(s) or
 ///if \c v itself a root.
 ///The shortest path tree used here is equal to the shortest path
-///tree used in \ref pred().
+///tree used in \ref predEdge().
 ///\pre Either \ref run() or \ref start() must be called before
 ///using this function.
 Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
 				  G->source((*_pred)[v]); }