1.1 --- a/src/lemon/dijkstra.h	Thu Nov 04 18:52:31 2004 +0000
     1.2 +++ b/src/lemon/dijkstra.h	Thu Nov 04 20:24:59 2004 +0000
     1.3 @@ -33,11 +33,11 @@
     1.4  
     1.5    ///This class provides an efficient implementation of %Dijkstra algorithm.
     1.6    ///The edge lengths are passed to the algorithm using a
     1.7 -  ///\ref skeleton::ReadMap "ReadMap",
     1.8 +  ///\ref concept::ReadMap "ReadMap",
     1.9    ///so it is easy to change it to any kind of length.
    1.10    ///
    1.11    ///The type of the length is determined by the
    1.12 -  ///\ref skeleton::ReadMap::ValueType "ValueType" of the length map.
    1.13 +  ///\ref concept::ReadMap::ValueType "ValueType" of the length map.
    1.14    ///
    1.15    ///It is also possible to change the underlying priority heap.
    1.16    ///
    1.17 @@ -48,7 +48,7 @@
    1.18    ///lengths of the edges. It is read once for each edge, so the map
    1.19    ///may involve in relatively time consuming process to compute the edge
    1.20    ///length if it is necessary. The default map type is
    1.21 -  ///\ref skeleton::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    1.22 +  ///\ref concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>"
    1.23    ///\param Heap The heap type used by the %Dijkstra
    1.24    ///algorithm. The default
    1.25    ///is using \ref BinHeap "binary heap".