Index: doc/algorithms.dox
===================================================================
 doc/algorithms.dox (revision 2470)
+++ doc/algorithms.dox (revision 2476)
@@ 115,5 +115,5 @@
\skip MyOrdererMap
\until };
The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing
+The class meets the \ref concepts::WriteMap "WriteMap" concept. In it's \c set() method the only thing
we need to do is insert the key  that is the node whose processing just finished  into the beginning
of the list.
Index: doc/basic_concepts.dox
===================================================================
 doc/basic_concepts.dox (revision 2391)
+++ doc/basic_concepts.dox (revision 2476)
@@ 30,5 +30,5 @@
have to satisfy one or more \ref concept "graph concepts" which are standardized
interfaces to work with the rest of the library. The most basic concept is the
\ref Graph.
+\ref concepts::Graph "Graph".
A good example is the \ref ListGraph which we already know from Hello World and
will be used in our examples as well.
@@ 48,5 +48,5 @@
to the graph with the addNode() member function. It returns the newly added node
(as value). So if you need the new node to do something useful with, for example
create an edge, assign a value to it through \ref map1 maps.
+create an edge, assign a value to it through \ref maps1 maps.
\code lemon::ListGraph::Node new_node = graph.addNode(); \endcode
@@ 115,6 +115,8 @@
the next page.)
The \ref EdgeIt works exactly the same  nothing more to say. But there are \ref InEdgeIt
and \ref OutEdgeIt by directed graphs and \ref IncEdgeIt by undirected graphs.
+The \ref concepts::Graph::EdgeIt "EdgeIt" works exactly the same  nothing more to say.
+But there are \ref concepts::Graph::InEdgeIt "InEdgeIt" and
+\ref concepts::Graph::OutEdgeIt "OutEdgeIt" by directed graphs and
+\ref concepts::UGraph::IncEdgeIt "IncEdgeIt" by undirected graphs.
They take two arguments. The first is a graph, the second is certain node of the
graph. InEdgeIt iterates on the incoming edges of that node and OutEdgeIt does it
Index: doc/graphs.dox
===================================================================
 doc/graphs.dox (revision 2391)
+++ doc/graphs.dox (revision 2476)
@@ 17,6 +17,7 @@
*/
+namespace lemon {
+
/*!

\page graphs Graphs
@@ 30,5 +31,5 @@
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,20 +38,18 @@
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,9 +57,9 @@
\ref mapspage "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,5 +120,5 @@
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,2 +200,5 @@
*/
+
+}
+
Index: doc/maps1.dox
===================================================================
 doc/maps1.dox (revision 2408)
+++ doc/maps1.dox (revision 2476)
@@ 16,4 +16,6 @@
*
*/
+
+namespace lemon {
/**
@@ 35,14 +37,14 @@
To make easy to use them  especially as template parameters  there are map concepts like by graph classes.
 \ref ReadMap  values can be read out with the \c operator[].
+
 \ref concepts::ReadMap "ReadMap"  values can be read out with the \c operator[].
\code value_typed_variable = map_instance[key_value]; \endcode
 \ref WriteMap  values can be set with the \c set() member function.
+
 \ref concepts::WriteMap "WriteMap"  values can be set with the \c set() member function.
\code map_instance.set(key_value, value_typed_expression); \endcode
 \ref ReadWriteMap  it's just a shortcut to indicate that the map is both
+
 \ref concepts::ReadWriteMap "ReadWriteMap"  it's just a shortcut to indicate that the map is both
readable and writable. It is delivered from them.
 \ref ReferenceMap  a subclass of ReadWriteMap. It has two additional typedefs
+
 \ref concepts::ReferenceMap "ReferenceMap"  a subclass of ReadWriteMap. It has two additional typedefs
Reference and ConstReference and two overloads of \c operator[] to
providing you constant or nonconstant reference to the value belonging to a key,
@@ 50,5 +52,7 @@
 And there are the Matrix version of these maps, where the values are assigned to a pair of keys.
The keys can be different types. (\ref ReadMatrixMap, \ref WriteMatrixMap, \ref ReadWriteMatrixMap, \ref ReferenceMatrixMap)
+The keys can be different types. (\ref concepts::ReadMatrixMap "ReadMatrixMap",
+\ref concepts::WriteMatrixMap "WriteMatrixMap", \ref concepts::ReadWriteMatrixMap "ReadWriteMatrixMap",
+\ref concepts::ReferenceMatrixMap "ReferenceMatrixMap")
@@ 89,2 +93,4 @@
Or if you want to know more about maps read these \ref maps2 "advanced map techniques".
*/
+
+}