Changeset 2260:4274224f8a7d in lemon-0.x for lemon/fredman_tarjan.h

Timestamp:

10/24/06 19:19:16 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016

Message:

concept -> concepts (namespace & directory)

File:

• lemon/fredman_tarjan.h (modified) (6 diffs)

lemon/fredman_tarjan.h

@@ -37 +37 @@
 #include <lemon/graph_utils.h>
 
-#include <lemon/concept/ugraph.h>
+#include <lemon/concepts/ugraph.h>
 
 namespace lemon {
@@ -53 +53 @@
 
     ///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.
@@ -62 +62 @@
     ///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;
@@ -89 +89 @@
   ///
   ///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
@@ -104 +104 @@
   ///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.
@@ -366 +366 @@
       _tree(0), local_tree(false)
     {
-      checkConcept<concept::UGraph, UGraph>();
+      checkConcept<concepts::UGraph, UGraph>();
     }