/// \brief 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 it \c t is a source itself or unreachable, then it does not

     /// alter \c p.

     ///Gives back the shortest path.

     ///

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

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

     Path path(Node t) 

     /// \c false otherwise.

     {

     /// \sa DirPath

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

     template <typename Path>

     bool getPath(Path &p, Node t) {

       if(reached(t)) {

 	p.clear();

 	typename Path::Builder b(p);

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

 	  b.pushFront(predEdge(t));

 	b.commit();

 	return true;

       }

       return false;