1.1 --- a/lemon/prim.h	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/lemon/prim.h	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -30,7 +30,7 @@
     1.4  #include <lemon/maps.h>
     1.5  #include <lemon/bits/traits.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 @@ -46,7 +46,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 @@ -82,7 +82,7 @@
    1.22      /// 
    1.23      ///The type of the map that stores the last
    1.24      ///edges of the minimum spanning tree.
    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 UGraph::template NodeMap<typename GR::UEdge> PredMap;
    1.29      ///Instantiates a PredMap.
    1.30 @@ -113,7 +113,7 @@
    1.31      ///The type of the map that stores whether a nodes is processed.
    1.32   
    1.33      ///The type of the map that stores whether a nodes is processed.
    1.34 -    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    1.35 +    ///It must meet the \ref concepts::WriteMap "WriteMap" concept.
    1.36      ///By default it is a NodeMap<bool>.
    1.37      typedef NullMap<typename UGraph::Node,bool> ProcessedMap;
    1.38      ///Instantiates a ProcessedMap.
    1.39 @@ -140,11 +140,11 @@
    1.40    ///n is the number of nodes in the graph.
    1.41    ///
    1.42    ///The edge costs are passed to the algorithm using a
    1.43 -  ///\ref concept::ReadMap "ReadMap",
    1.44 +  ///\ref concepts::ReadMap "ReadMap",
    1.45    ///so it is easy to change it to any kind of cost.
    1.46    ///
    1.47    ///The type of the cost is determined by the
    1.48 -  ///\ref concept::ReadMap::Value "Value" of the cost map.
    1.49 +  ///\ref concepts::ReadMap::Value "Value" of the cost map.
    1.50    ///
    1.51    ///It is also possible to change the underlying priority heap.
    1.52    ///
    1.53 @@ -156,7 +156,7 @@
    1.54    ///edges. It is read once for each edge, so the map may involve in
    1.55    ///relatively time consuming process to compute the edge cost if
    1.56    ///it is necessary. The default map type is \ref
    1.57 -  ///concept::UGraph::UEdgeMap "UGraph::UEdgeMap<int>".  The value
    1.58 +  ///concepts::UGraph::UEdgeMap "UGraph::UEdgeMap<int>".  The value
    1.59    ///of CM is not used directly by Prim, it is only passed to \ref
    1.60    ///PrimDefaultTraits.
    1.61    ///
    1.62 @@ -412,7 +412,7 @@
    1.63        _heap_cross_ref(NULL), local_heap_cross_ref(false),
    1.64        _heap(NULL), local_heap(false)
    1.65      {
    1.66 -      checkConcept<concept::UGraph, UGraph>();
    1.67 +      checkConcept<concepts::UGraph, UGraph>();
    1.68      }
    1.69      
    1.70      ///Destructor.