Changeset 2476:059dcdda37c5 in lemon-0.x for doc/graphs.dox

Timestamp:

09/27/07 15:04:06 (17 years ago)

Author:

Peter Kovacs

Branch:

default

Phase:

public

Convert:

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

Message:

Bug fixes in the documentation (mainly bad references).

File:

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

doc/graphs.dox

@@ -17 +17 @@
  */
 
+namespace lemon {
+
 /*!
-
 \page graphs Graphs
 
@@ -30 +31 @@
 as  incoming and outgoing edges of a given node. 
 
-Each graph should meet the \ref lemon::concepts::Graph "Graph" concept.
+Each graph should meet the \ref 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
@@ -37 +38 @@
 
 In case of graphs meeting the full feature
-\ref lemon::concepts::ErasableGraph "ErasableGraph"
-concept
+\ref concepts::ErasableGraph "ErasableGraph" concept
 you can also erase individual edges and nodes in arbitrary order.
 
 The implemented graph structures are the following.
-\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
-the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept
+\li \ref ListGraph is the most versatile graph class. It meets
+the \ref 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::concepts::ExtendableGraph "ExtendableGraph" concept,
+\li \ref SmartGraph is a more memory efficient version of \ref ListGraph.
+The price of this is that it only meets the
+\ref concepts::ExtendableGraph "ExtendableGraph" concept,
 so you cannot delete individual edges or nodes.
-\li \ref lemon::FullGraph "FullGraph"
+\li \ref FullGraph "FullGraph"
 implements a complete graph. It is a
-\ref lemon::concepts::Graph "Graph", so you cannot
+\ref 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
@@ -58 +57 @@
 \ref maps-page "EdgeMap"'s will depend on the number of nodes.
 
-\li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class
+\li \ref NodeSet "NodeSet" implements a graph with no edges. This class
 can be used as a base class of \ref lemon::EdgeSet "EdgeSet".
-\li \ref lemon::EdgeSet "EdgeSet" can be used to create a new graph on
+\li \ref EdgeSet "EdgeSet" can be used to create a new graph on
 the node set of another graph. The base graph can be an arbitrary graph and it
-is possible to attach several \ref lemon::EdgeSet "EdgeSet"'s to a base graph.
+is possible to attach several \ref EdgeSet "EdgeSet"'s to a base graph.
 
 \todo Don't we need SmartNodeSet and SmartEdgeSet?
@@ -121 +120 @@
 step to the next node. Using operator++ on the iterator pointing to the last
 node invalidates the iterator i.e. sets its value to
-\ref lemon::INVALID "INVALID". This is what we exploit in the stop condition.
+\ref INVALID. This is what we exploit in the stop condition.
 
 The previous code fragment prints out the following:
@@ -201 +200 @@
 
 */
+
+}
+