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

     typedef PredMatrixMapPath<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.

     /// \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 \c t.

     /// \c false otherwise.

     Path path(Node s, Node t) 

     /// \sa DirPath

     {

     template <typename Path>

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

     bool getPath(Path &p, Node source, Node target) {

       if (connected(source, target)) {

 	p.clear();

 	typename Path::Builder b(target);

 	for(b.setStartNode(target); predEdge(source, target) != INVALID;

 	    target = predNode(target)) {

 	  b.pushFront(predEdge(source, target));

 	}

 	b.commit();

 	return true;

       }

       return false;