diff -r da142c310d02 -r 4274224f8a7d lemon/fredman_tarjan.h
--- a/lemon/fredman_tarjan.h	Tue Oct 24 16:49:41 2006 +0000
+++ b/lemon/fredman_tarjan.h	Tue Oct 24 17:19:16 2006 +0000
@@ -36,7 +36,7 @@
 #include <lemon/bits/traits.h>
 #include <lemon/graph_utils.h>
 
-#include <lemon/concept/ugraph.h>
+#include <lemon/concepts/ugraph.h>
 
 namespace lemon {
 
@@ -52,7 +52,7 @@
     ///The type of the map that stores the edge costs.
 
     ///The type of the map that stores the edge costs.
-    ///It must meet the \ref concept::ReadMap "ReadMap" concept.
+    ///It must meet the \ref concepts::ReadMap "ReadMap" concept.
     typedef CM CostMap;
     //The type of the cost of the edges.
     typedef typename CM::Value Value;
@@ -61,7 +61,7 @@
 
     ///The type of the map that stores whether an edge is in the
     ///spanning tree or not.
-    ///It must meet the \ref concept::ReadWriteMap "ReadWriteMap" concept.
+    ///It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
     ///By default it is a BoolEdgeMap.
     typedef typename UGraph::template UEdgeMap<bool> TreeMap;
     ///Instantiates a TreeMap.
@@ -88,11 +88,11 @@
   /// \f$ \log^{i+1}(n)=\log(\log^{i}(n)) \f$
   ///
   ///The edge costs are passed to the algorithm using a \ref
-  ///concept::ReadMap "ReadMap", so it is easy to change it to any
+  ///concepts::ReadMap "ReadMap", so it is easy to change it to any
   ///kind of cost.
   ///
   ///The type of the cost is determined by the \ref
-  ///concept::ReadMap::Value "Value" of the cost map.
+  ///concepts::ReadMap::Value "Value" of the cost map.
   ///
   ///\param GR The graph type the algorithm runs on. The default value
   ///is \ref ListUGraph. The value of GR is not used directly by
@@ -103,7 +103,7 @@
   ///edges. It is read once for each edge, so the map may involve in
   ///relatively time consuming process to compute the edge cost if it
   ///is necessary. The default map type is \ref
-  ///concept::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of
+  ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>". The value of
   ///CM is not used directly by FredmanTarjan, it is only passed to
   ///\ref FredmanTarjanDefaultTraits.
   ///
@@ -365,7 +365,7 @@
       graph(&_graph), cost(&_cost),
       _tree(0), local_tree(false)
     {
-      checkConcept<concept::UGraph, UGraph>();
+      checkConcept<concepts::UGraph, UGraph>();
     }
     
     ///Destructor.