1.1 --- a/lemon/floyd_warshall.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/floyd_warshall.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -94,7 +94,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 @@ -129,7 +129,7 @@
    1.13      /// \brief The type of the map that stores the dists of the nodes.
    1.14      ///
    1.15      /// The type of the map that stores the dists of the nodes.
    1.16 -    /// It must meet the \ref concept::WriteMatrixMap "WriteMatrixMap" concept.
    1.17 +    /// It must meet the \ref concepts::WriteMatrixMap "WriteMatrixMap" concept.
    1.18      ///
    1.19      typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap;
    1.20  
    1.21 @@ -149,7 +149,7 @@
    1.22    /// \ingroup flowalgs
    1.23    /// This class provides an efficient implementation of \c Floyd-Warshall 
    1.24    /// algorithm. The edge lengths are passed to the algorithm using a
    1.25 -  /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
    1.26 +  /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 
    1.27    /// kind of length.
    1.28    ///
    1.29    /// The algorithm solves the shortest path problem for each pair
    1.30 @@ -162,7 +162,7 @@
    1.31    /// The complexity of this algorithm is \f$ O(n^3+e) \f$.
    1.32    ///
    1.33    /// The type of the length is determined by the
    1.34 -  /// \ref concept::ReadMap::Value "Value" of the length map.
    1.35 +  /// \ref concepts::ReadMap::Value "Value" of the length map.
    1.36    ///
    1.37    /// \param _Graph The graph type the algorithm runs on. The default value
    1.38    /// is \ref ListGraph. The value of _Graph is not used directly by
    1.39 @@ -171,7 +171,7 @@
    1.40    /// edges. It is read once for each edge, so the map may involve in
    1.41    /// relatively time consuming process to compute the edge length if
    1.42    /// it is necessary. The default map type is \ref
    1.43 -  /// concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
    1.44 +  /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
    1.45    /// of _LengthMap is not used directly by FloydWarshall, it is only passed 
    1.46    /// to \ref FloydWarshallDefaultTraits.  \param _Traits Traits class to set
    1.47    /// various data types used by the algorithm.  The default traits