Changeset 2260:4274224f8a7d in lemon-0.x for doc

Timestamp:

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

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

concept -> concepts (namespace & directory)

Location:

doc

Files:

• graphs.dox (modified) (3 diffs)
• groups.dox (modified) (2 diffs)
• maps.dox (modified) (1 diff)
• namespaces.dox (modified) (1 diff)

doc/graphs.dox

@@ -12 +12 @@
 as  incoming and outgoing edges of a given node. 
 
-Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
+Each graph should meet the \ref lemon::concepts::Graph "Graph" concept.
 This concept does not make it possible to change the graph (i.e. it is
 not possible to add or delete edges or nodes). Most of the graph
@@ -19 +19 @@
 
 In case of graphs meeting the full feature
-\ref lemon::concept::ErasableGraph "ErasableGraph"
+\ref lemon::concepts::ErasableGraph "ErasableGraph"
 concept
 you can also erase individual edges and nodes in arbitrary order.
@@ -25 +25 @@
 The implemented graph structures are the following.
 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
-the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
+the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept
 and it also has some convenient extra features.
 \li \ref lemon::SmartGraph "SmartGraph" is a more memory
 efficient version of \ref lemon::ListGraph "ListGraph". The
 price of this is that it only meets the
-\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
+\ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept,
 so you cannot delete individual edges or nodes.
 \li \ref lemon::FullGraph "FullGraph"
 implements a complete graph. It is a
-\ref lemon::concept::Graph "Graph", so you cannot
+\ref lemon::concepts::Graph "Graph", so you cannot
 change the number of nodes once it is constructed. It is extremely memory
 efficient: it uses constant amount of memory independently from the number of

doc/groups.dox

@@ -77 +77 @@
 Map adaptors are used to create "implicit" maps from other maps.
 
-Most of them are \ref lemon::concept::ReadMap "ReadMap"s. They can
+Most of them are \ref lemon::concepts::ReadMap "ReadMap"s. They can
 make arithmetic operations between one or two maps (negation, scaling,
 addition, multiplication etc.) or e.g. convert a map to another one
@@ -103 +103 @@
 algorithm to store its result in any kind of path structure.
 
-\sa lemon::concept::Path
+\sa lemon::concepts::Path
 
 */

doc/maps.dox

@@ -14 +14 @@
 
 A map can be 
-\e readable (\ref lemon::concept::ReadMap "ReadMap", for short),
-\e writable (\ref lemon::concept::WriteMap "WriteMap") or both
-(\ref lemon::concept::ReadWriteMap "ReadWriteMap").
+\e readable (\ref lemon::concepts::ReadMap "ReadMap", for short),
+\e writable (\ref lemon::concepts::WriteMap "WriteMap") or both
+(\ref lemon::concepts::ReadWriteMap "ReadWriteMap").
 There also exists a special type of
-ReadWrite map called \ref lemon::concept::ReferenceMap "reference map".
+ReadWrite map called \ref lemon::concepts::ReferenceMap "reference map".
 In addition that you can
 read and write the values of a key, a reference map

doc/namespaces.dox

@@ -9 +9 @@
   /// The namespace of LEMON concepts and concept checking classes
   ///
-  namespace concept {}
+  namespace concepts {}
 }