Changeset 959:c80ef5912903 in lemon-0.x for doc/graphs.dox

Timestamp:

11/04/04 21:24:59 (19 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

skeleton(s) -> concept renaming

File:

• doc/graphs.dox (modified) (5 diffs)

doc/graphs.dox

@@ -10 +10 @@
 
 Each graph should meet the
-\ref lemon::skeleton::StaticGraph "StaticGraph" concept.
+\ref lemon::concept::StaticGraph "StaticGraph" concept.
 This concept does not
 makes it possible to change the graph (i.e. it is not possible to add
@@ -17 +17 @@
 
 The graphs meeting the
-\ref lemon::skeleton::ExtendableGraph "ExtendableGraph"
+\ref lemon::concept::ExtendableGraph "ExtendableGraph"
 concept allow node and
 edge addition. You can also "clear" (i.e. erase all edges and nodes)
@@ -23 +23 @@
 
 In case of graphs meeting the full feature
-\ref lemon::skeleton::ErasableGraph "ErasableGraph"
+\ref lemon::concept::ErasableGraph "ErasableGraph"
 concept
 you can also erase individual edges and node in arbitrary order.
@@ -29 +29 @@
 The implemented graph structures are the following.
 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
-the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept
+the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
 and it also have some convenience features.
 \li \ref lemon::SmartGraph "SmartGraph" is a more memory
 efficient version of \ref lemon::ListGraph "ListGraph". The
 price of it is that it only meets the
-\ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept,
+\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
 so you cannot delete individual edges or nodes.
 \li \ref lemon::SymListGraph "SymListGraph" and
@@ -46 +46 @@
 are shared by the edge pairs. 
 \li \ref lemon::FullGraph "FullGraph"
-implements a full graph. It is a \ref lemon::skeleton::StaticGraph, so you cannot
+implements a full graph. It is a \ref lemon::concept::StaticGraph, 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