diff -r 5e284075b193 -r 9d0bfd35b97c src/hugo/dijkstra.h --- a/src/hugo/dijkstra.h Fri Sep 17 15:11:39 2004 +0000 +++ b/src/hugo/dijkstra.h Fri Sep 17 15:51:50 2004 +0000 @@ -18,10 +18,11 @@ ///This class provides an efficient implementation of %Dijkstra algorithm. ///The edge lengths are passed to the algorithm using a - ///\ref ReadMapSkeleton "readable map", + ///\ref skeleton::ReadMap "ReadMap", ///so it is easy to change it to any kind of length. /// - ///The type of the length is determined by the \c ValueType of the length map. + ///The type of the length is determined by the + ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map. /// ///It is also possible to change the underlying priority heap. /// @@ -32,7 +33,7 @@ ///lengths of the edges. It is read once for each edge, so the map ///may involve in relatively time consuming process to compute the edge ///length if it is necessary. The default map type is - ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap" + ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap" ///\param Heap The heap type used by the %Dijkstra ///algorithm. The default ///is using \ref BinHeap "binary heap".