1.1 --- a/lemon/bellman_ford.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/bellman_ford.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -92,7 +92,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 @@ -110,7 +110,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 @@ -125,7 +125,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 @@ -146,7 +146,7 @@
    1.31    /// \ingroup flowalgs
    1.32    /// This class provides an efficient implementation of \c Bellman-Ford 
    1.33    /// algorithm. The edge lengths are passed to the algorithm using a
    1.34 -  /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
    1.35 +  /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 
    1.36    /// kind of length.
    1.37    ///
    1.38    /// The Bellman-Ford algorithm solves the shortest path from one node
    1.39 @@ -158,13 +158,13 @@
    1.40    /// The maximal time complexity of the algorithm is \f$ O(ne) \f$.
    1.41    ///
    1.42    /// The type of the length is determined by the
    1.43 -  /// \ref concept::ReadMap::Value "Value" of the length map.
    1.44 +  /// \ref concepts::ReadMap::Value "Value" of the length map.
    1.45    ///
    1.46    /// \param _Graph The graph type the algorithm runs on. The default value
    1.47    /// is \ref ListGraph. The value of _Graph is not used directly by
    1.48    /// BellmanFord, it is only passed to \ref BellmanFordDefaultTraits.
    1.49    /// \param _LengthMap This read-only EdgeMap determines the lengths of the
    1.50 -  /// edges. The default map type is \ref concept::Graph::EdgeMap 
    1.51 +  /// edges. The default map type is \ref concepts::Graph::EdgeMap 
    1.52    /// "Graph::EdgeMap<int>".  The value of _LengthMap is not used directly 
    1.53    /// by BellmanFord, it is only passed to \ref BellmanFordDefaultTraits.  
    1.54    /// \param _Traits Traits class to set various data types used by the 
    1.55 @@ -790,7 +790,7 @@
    1.56      /// \brief The type of the map that stores the edge lengths.
    1.57      ///
    1.58      /// The type of the map that stores the edge lengths.
    1.59 -    /// It must meet the \ref concept::ReadMap "ReadMap" concept.
    1.60 +    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
    1.61      typedef _LengthMap LengthMap;
    1.62  
    1.63      /// \brief The value type of the length map.
    1.64 @@ -808,7 +808,7 @@
    1.65      /// 
    1.66      /// The type of the map that stores the last
    1.67      /// edges of the shortest paths.
    1.68 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.69 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.70      typedef NullMap <typename _Graph::Node,typename _Graph::Edge> PredMap;
    1.71  
    1.72      /// \brief Instantiates a PredMap.
    1.73 @@ -820,7 +820,7 @@
    1.74      /// \brief The type of the map that stores the dists of the nodes.
    1.75      ///
    1.76      /// The type of the map that stores the dists of the nodes.
    1.77 -    /// It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.78 +    /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.79      typedef NullMap<typename Graph::Node, Value> DistMap;
    1.80      /// \brief Instantiates a DistMap.
    1.81      ///