///Copies the shortest path to \c t into \c p

     typedef PredMapPath<Graph, PredMap> Path;

     ///This function copies the shortest path to \c t into \c p.

     ///Gives back the shortest path.

     ///If \c t is a source itself or unreachable, then it does not

     ///alter \c p.

     ///Gives back the shortest path.

     ///\return Returns \c true if a path to \c t was actually copied to \c p,

     ///\pre The \c t should be reachable from the source.

     ///\c false otherwise.

     Path path(Node t) 

     ///\sa DirPath

     {

     template<class P>

       return Path(*G, *_pred, t);

     bool getPath(P &p,Node t) 

     {

       if(reached(t)) {

 	p.clear();

 	typename P::Builder b(p);

 	for(b.setStartNode(t);predEdge(t)!=INVALID;t=predNode(t))

 	  b.pushFront(predEdge(t));

 	b.commit();

 	return true;

       }

       return false;