Changeset 2260:4274224f8a7d in lemon-0.x for lemon/floyd_warshall.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/floyd_warshall.h (modified) (5 diffs)

lemon/floyd_warshall.h

@@ -95 +95 @@
     ///
     /// The type of the map that stores the edge lengths.
-    /// It must meet the \ref concept::ReadMap "ReadMap" concept.
+    /// It must meet the \ref concepts::ReadMap "ReadMap" concept.
     typedef _LengthMap LengthMap;
 
@@ -130 +130 @@
     ///
     /// The type of the map that stores the dists of the nodes.
-    /// It must meet the \ref concept::WriteMatrixMap "WriteMatrixMap" concept.
+    /// It must meet the \ref concepts::WriteMatrixMap "WriteMatrixMap" concept.
     ///
     typedef DynamicMatrixMap<Graph, typename Graph::Node, Value> DistMap;
@@ -150 +150 @@
   /// This class provides an efficient implementation of \c Floyd-Warshall 
   /// algorithm. The edge lengths are passed to the algorithm using a
-  /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
+  /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any 
   /// kind of length.
   ///
@@ -163 +163 @@
   ///
   /// The type of the length is determined by the
-  /// \ref concept::ReadMap::Value "Value" of the length map.
+  /// \ref concepts::ReadMap::Value "Value" of the length map.
   ///
   /// \param _Graph The graph type the algorithm runs on. The default value
@@ -172 +172 @@
   /// relatively time consuming process to compute the edge length if
   /// it is necessary. The default map type is \ref
-  /// concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
+  /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
   /// of _LengthMap is not used directly by FloydWarshall, it is only passed 
   /// to \ref FloydWarshallDefaultTraits.  \param _Traits Traits class to set