1.1 --- a/lemon/fredman_tarjan.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/fredman_tarjan.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -36,7 +36,7 @@
     1.4  #include <lemon/bits/traits.h>
     1.5  #include <lemon/graph_utils.h>
     1.6  
     1.7 -#include <lemon/concept/ugraph.h>
     1.8 +#include <lemon/concepts/ugraph.h>
     1.9  
    1.10  namespace lemon {
    1.11  
    1.12 @@ -52,7 +52,7 @@
    1.13      ///The type of the map that stores the edge costs.
    1.14  
    1.15      ///The type of the map that stores the edge costs.
    1.16 -    ///It must meet the \ref concept::ReadMap "ReadMap" concept.
    1.17 +    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
    1.18      typedef CM CostMap;
    1.19      //The type of the cost of the edges.
    1.20      typedef typename CM::Value Value;
    1.21 @@ -61,7 +61,7 @@
    1.22  
    1.23      ///The type of the map that stores whether an edge is in the
    1.24      ///spanning tree or not.
    1.25 -    ///It must meet the \ref concept::ReadWriteMap "ReadWriteMap" concept.
    1.26 +    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.27      ///By default it is a BoolEdgeMap.
    1.28      typedef typename UGraph::template UEdgeMap<bool> TreeMap;
    1.29      ///Instantiates a TreeMap.
    1.30 @@ -88,11 +88,11 @@
    1.31    /// \f$ \log^{i+1}(n)=\log(\log^{i}(n)) \f$
    1.32    ///
    1.33    ///The edge costs are passed to the algorithm using a \ref
    1.34 -  ///concept::ReadMap "ReadMap", so it is easy to change it to any
    1.35 +  ///concepts::ReadMap "ReadMap", so it is easy to change it to any
    1.36    ///kind of cost.
    1.37    ///
    1.38    ///The type of the cost is determined by the \ref
    1.39 -  ///concept::ReadMap::Value "Value" of the cost map.
    1.40 +  ///concepts::ReadMap::Value "Value" of the cost map.
    1.41    ///
    1.42    ///\param GR The graph type the algorithm runs on. The default value
    1.43    ///is \ref ListUGraph. The value of GR is not used directly by
    1.44 @@ -103,7 +103,7 @@
    1.45    ///edges. It is read once for each edge, so the map may involve in
    1.46    ///relatively time consuming process to compute the edge cost if it
    1.47    ///is necessary. The default map type is \ref
    1.48 -  ///concept::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of
    1.49 +  ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of
    1.50    ///CM is not used directly by FredmanTarjan, it is only passed to
    1.51    ///\ref FredmanTarjanDefaultTraits.
    1.52    ///
    1.53 @@ -365,7 +365,7 @@
    1.54        graph(&_graph), cost(&_cost),
    1.55        _tree(0), local_tree(false)
    1.56      {
    1.57 -      checkConcept<concept::UGraph, UGraph>();
    1.58 +      checkConcept<concepts::UGraph, UGraph>();
    1.59      }
    1.60      
    1.61      ///Destructor.