1.1 --- a/lemon/dijkstra.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/dijkstra.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -48,7 +48,7 @@
     1.4      ///The type of the map that stores the edge lengths.
     1.5  
     1.6      ///The type of the map that stores the edge lengths.
     1.7 -    ///It must meet the \ref concept::ReadMap "ReadMap" concept.
     1.8 +    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
     1.9      typedef LM LengthMap;
    1.10      //The type of the length of the edges.
    1.11      typedef typename LM::Value Value;
    1.12 @@ -86,7 +86,7 @@
    1.13      /// 
    1.14      ///The type of the map that stores the last
    1.15      ///edges of the shortest paths.
    1.16 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.17 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.18      ///
    1.19      typedef typename Graph::template NodeMap<typename GR::Edge> PredMap;
    1.20      ///Instantiates a PredMap.
    1.21 @@ -102,7 +102,7 @@
    1.22      ///The type of the map that stores whether a nodes is processed.
    1.23   
    1.24      ///The type of the map that stores whether a nodes is processed.
    1.25 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.26 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.27      ///By default it is a NullMap.
    1.28      ///\todo If it is set to a real map,
    1.29      ///Dijkstra::processed() should read this.
    1.30 @@ -124,7 +124,7 @@
    1.31      ///The type of the map that stores the dists of the nodes.
    1.32   
    1.33      ///The type of the map that stores the dists of the nodes.
    1.34 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.35 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.36      ///
    1.37      typedef typename Graph::template NodeMap<typename LM::Value> DistMap;
    1.38      ///Instantiates a DistMap.
    1.39 @@ -142,11 +142,11 @@
    1.40    /// \ingroup flowalgs
    1.41    ///This class provides an efficient implementation of %Dijkstra algorithm.
    1.42    ///The edge lengths are passed to the algorithm using a
    1.43 -  ///\ref concept::ReadMap "ReadMap",
    1.44 +  ///\ref concepts::ReadMap "ReadMap",
    1.45    ///so it is easy to change it to any kind of length.
    1.46    ///
    1.47    ///The type of the length is determined by the
    1.48 -  ///\ref concept::ReadMap::Value "Value" of the length map.
    1.49 +  ///\ref concepts::ReadMap::Value "Value" of the length map.
    1.50    ///
    1.51    ///It is also possible to change the underlying priority heap.
    1.52    ///
    1.53 @@ -157,7 +157,7 @@
    1.54    ///edges. It is read once for each edge, so the map may involve in
    1.55    ///relatively time consuming process to compute the edge length if
    1.56    ///it is necessary. The default map type is \ref
    1.57 -  ///concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
    1.58 +  ///concepts::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
    1.59    ///of LM is not used directly by Dijkstra, it is only passed to \ref
    1.60    ///DijkstraDefaultTraits.  \param TR Traits class to set
    1.61    ///various data types used by the algorithm.  The default traits
    1.62 @@ -819,7 +819,7 @@
    1.63      ///The type of the map that stores the edge lengths.
    1.64  
    1.65      ///The type of the map that stores the edge lengths.
    1.66 -    ///It must meet the \ref concept::ReadMap "ReadMap" concept.
    1.67 +    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
    1.68      typedef LM LengthMap;
    1.69      //The type of the length of the edges.
    1.70      typedef typename LM::Value Value;
    1.71 @@ -861,7 +861,7 @@
    1.72      /// 
    1.73      ///The type of the map that stores the last
    1.74      ///edges of the shortest paths.
    1.75 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.76 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.77      ///
    1.78      typedef NullMap <typename GR::Node,typename GR::Edge> PredMap;
    1.79      ///Instantiates a PredMap.
    1.80 @@ -880,7 +880,7 @@
    1.81      ///The type of the map that stores whether a nodes is processed.
    1.82   
    1.83      ///The type of the map that stores whether a nodes is processed.
    1.84 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.85 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.86      ///By default it is a NullMap.
    1.87      ///\todo If it is set to a real map,
    1.88      ///Dijkstra::processed() should read this.
    1.89 @@ -902,7 +902,7 @@
    1.90      ///The type of the map that stores the dists of the nodes.
    1.91   
    1.92      ///The type of the map that stores the dists of the nodes.
    1.93 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.94 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.95      ///
    1.96      typedef NullMap<typename Graph::Node,typename LM::Value> DistMap;
    1.97      ///Instantiates a DistMap.