1.1 --- a/lemon/dag_shortest_path.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/dag_shortest_path.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -93,7 +93,7 @@
     1.4      /// \brief 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 _LengthMap LengthMap;
    1.10  
    1.11      // The type of the length of the edges.
    1.12 @@ -111,7 +111,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 _Graph::Edge> PredMap;
    1.20  
    1.21 @@ -128,7 +128,7 @@
    1.22      /// \brief The type of the map that stores the dists of the nodes.
    1.23      ///
    1.24      /// The type of the map that stores the dists of the nodes.
    1.25 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.26 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.27      ///
    1.28      typedef typename Graph::template NodeMap<typename _LengthMap::Value> 
    1.29      DistMap;
    1.30 @@ -205,7 +205,7 @@
    1.31      /// \brief The type of the map that stores the edge lengths.
    1.32      ///
    1.33      /// The type of the map that stores the edge lengths.
    1.34 -    /// It must meet the \ref concept::ReadMap "ReadMap" concept.
    1.35 +    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    1.36      typedef _LengthMap LengthMap;
    1.37  
    1.38      // The type of the length of the edges.
    1.39 @@ -223,7 +223,7 @@
    1.40      /// 
    1.41      /// The type of the map that stores the last
    1.42      /// edges of the longest paths.
    1.43 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.44 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.45      ///
    1.46      typedef typename Graph::template NodeMap<typename _Graph::Edge> PredMap;
    1.47  
    1.48 @@ -240,7 +240,7 @@
    1.49      /// \brief The type of the map that stores the dists of the nodes.
    1.50      ///
    1.51      /// The type of the map that stores the dists of the nodes.
    1.52 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.53 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.54      ///
    1.55      typedef typename Graph::template NodeMap<typename _LengthMap::Value> 
    1.56      DistMap;
    1.57 @@ -262,19 +262,19 @@
    1.58    /// \ingroup flowalgs
    1.59    /// This class provides an efficient implementation of a Dag sortest path
    1.60    /// searching algorithm. The edge lengths are passed to the algorithm
    1.61 -  /// using a \ref concept::ReadMap "ReadMap", so it is easy to change it
    1.62 +  /// using a \ref concepts::ReadMap "ReadMap", so it is easy to change it
    1.63    /// to any kind of length.
    1.64    ///
    1.65    /// The complexity of the algorithm is O(n + e).
    1.66    ///
    1.67    /// The type of the length is determined by the
    1.68 -  /// \ref concept::ReadMap::Value "Value" of the length map.
    1.69 +  /// \ref concepts::ReadMap::Value "Value" of the length map.
    1.70    ///
    1.71    /// \param _Graph The graph type the algorithm runs on. The default value
    1.72    /// is \ref ListGraph. The value of _Graph is not used directly by
    1.73    /// DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits.
    1.74    /// \param _LengthMap This read-only EdgeMap determines the lengths of the
    1.75 -  /// edges. The default map type is \ref concept::Graph::EdgeMap 
    1.76 +  /// edges. The default map type is \ref concepts::Graph::EdgeMap 
    1.77    /// "Graph::EdgeMap<int>".  The value of _LengthMap is not used directly 
    1.78    /// by DagShortestPath, it is only passed to \ref DagShortestPathDefaultTraits.  
    1.79    /// \param _Traits Traits class to set various data types used by the 
    1.80 @@ -811,7 +811,7 @@
    1.81      /// \brief The type of the map that stores the edge lengths.
    1.82      ///
    1.83      /// The type of the map that stores the edge lengths.
    1.84 -    /// It must meet the \ref concept::ReadMap "ReadMap" concept.
    1.85 +    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    1.86      typedef _LengthMap LengthMap;
    1.87  
    1.88      /// \brief The value type of the length map.
    1.89 @@ -829,7 +829,7 @@
    1.90      /// 
    1.91      /// The type of the map that stores the last
    1.92      /// edges of the shortest paths.
    1.93 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.94 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.95      typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap;
    1.96  
    1.97      /// \brief Instantiates a PredMap.
    1.98 @@ -841,7 +841,7 @@
    1.99      /// \brief The type of the map that stores the dists of the nodes.
   1.100      ///
   1.101      /// The type of the map that stores the dists of the nodes.
   1.102 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
   1.103 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
   1.104      typedef NullMap<typename Graph::Node, Value> DistMap;
   1.105      /// \brief Instantiates a DistMap.
   1.106      ///