diff -r da142c310d02 -r 4274224f8a7d lemon/prim.h
--- a/lemon/prim.h	Tue Oct 24 16:49:41 2006 +0000
+++ b/lemon/prim.h	Tue Oct 24 17:19:16 2006 +0000
@@ -30,7 +30,7 @@
 #include <lemon/maps.h>
 #include <lemon/bits/traits.h>
 
-#include <lemon/concept/ugraph.h>
+#include <lemon/concepts/ugraph.h>
 
 namespace lemon {
 
@@ -46,7 +46,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;
@@ -82,7 +82,7 @@
     /// 
     ///The type of the map that stores the last
     ///edges of the minimum spanning tree.
-    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
+    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
     ///
     typedef typename UGraph::template NodeMap<typename GR::UEdge> PredMap;
     ///Instantiates a PredMap.
@@ -113,7 +113,7 @@
     ///The type of the map that stores whether a nodes is processed.
  
     ///The type of the map that stores whether a nodes is processed.
-    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
+    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
     ///By default it is a NodeMap<bool>.
     typedef NullMap<typename UGraph::Node,bool> ProcessedMap;
     ///Instantiates a ProcessedMap.
@@ -140,11 +140,11 @@
   ///n is the number of nodes in the graph.
   ///
   ///The edge costs are passed to the algorithm using a
-  ///\ref concept::ReadMap "ReadMap",
+  ///\ref 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.
+  ///\ref concepts::ReadMap::Value "Value" of the cost map.
   ///
   ///It is also possible to change the underlying priority heap.
   ///
@@ -156,7 +156,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
+  ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>".  The value
   ///of CM is not used directly by Prim, it is only passed to \ref
   ///PrimDefaultTraits.
   ///
@@ -412,7 +412,7 @@
       _heap_cross_ref(NULL), local_heap_cross_ref(false),
       _heap(NULL), local_heap(false)
     {
-      checkConcept<concept::UGraph, UGraph>();
+      checkConcept<concepts::UGraph, UGraph>();
     }
     
     ///Destructor.