Index: doc/graphs.dox
===================================================================
--- doc/graphs.dox	(revision 911)
+++ doc/graphs.dox	(revision 921)
@@ -3,5 +3,5 @@
 \page graphs How to use graphs
 
-The primary data structures of HugoLib are the graph classes. They all
+The primary data structures of LEMON are the graph classes. They all
 provide a node list - edge list interface, i.e. they have
 functionalities to list the nodes and the edges of the graph as well
@@ -10,5 +10,5 @@
 
 Each graph should meet the
-\ref hugo::skeleton::StaticGraph "StaticGraph" concept.
+\ref lemon::skeleton::StaticGraph "StaticGraph" concept.
 This concept does not
 makes it possible to change the graph (i.e. it is not possible to add
@@ -17,5 +17,5 @@
 
 The graphs meeting the
-\ref hugo::skeleton::ExtendableGraph "ExtendableGraph"
+\ref lemon::skeleton::ExtendableGraph "ExtendableGraph"
 concept allow node and
 edge addition. You can also "clear" (i.e. erase all edges and nodes)
@@ -23,20 +23,20 @@
 
 In case of graphs meeting the full feature
-\ref hugo::skeleton::ErasableGraph "ErasableGraph"
+\ref lemon::skeleton::ErasableGraph "ErasableGraph"
 concept
 you can also erase individual edges and node in arbitrary order.
 
 The implemented graph structures are the following.
-\li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
-the \ref hugo::skeleton::ErasableGraph "ErasableGraph" concept
+\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
+the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept
 and it also have some convenience features.
-\li \ref hugo::SmartGraph "SmartGraph" is a more memory
-efficient version of \ref hugo::ListGraph "ListGraph". The
+\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 hugo::skeleton::ExtendableGraph "ExtendableGraph" concept,
+\ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept,
 so you cannot delete individual edges or nodes.
-\li \ref hugo::SymListGraph "SymListGraph" and
-\ref hugo::SymSmartGraph "SymSmartGraph" classes are very similar to
-\ref hugo::ListGraph "ListGraph" and \ref hugo::SmartGraph "SmartGraph".
+\li \ref lemon::SymListGraph "SymListGraph" and
+\ref lemon::SymSmartGraph "SymSmartGraph" classes are very similar to
+\ref lemon::ListGraph "ListGraph" and \ref lemon::SmartGraph "SmartGraph".
 The difference is that whenever you add a
 new edge to the graph, it actually adds a pair of oppositely directed edges.
@@ -45,6 +45,6 @@
 attach data to the edges in such a way that the stored data
 are shared by the edge pairs. 
-\li \ref hugo::FullGraph "FullGraph"
-implements a full graph. It is a \ref hugo::skeleton::StaticGraph, so you cannot
+\li \ref lemon::FullGraph "FullGraph"
+implements a full graph. It is a \ref lemon::skeleton::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
@@ -52,9 +52,9 @@
 \ref maps "EdgeMap"'s will depend on the number of nodes.
 
-\li \ref hugo::NodeSet "NodeSet" implements a graph with no edges. This class
-can be used as a base class of \ref hugo::EdgeSet "EdgeSet".
-\li \ref hugo::EdgeSet "EdgeSet" can be used to create a new graph on
+\li \ref lemon::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
 the node set of another graph. The base graph can be an arbitrary graph and it
-is possible to attach several \ref hugo::EdgeSet "EdgeSet"'s to a base graph.
+is possible to attach several \ref lemon::EdgeSet "EdgeSet"'s to a base graph.
 
 \todo Don't we need SmartNodeSet and SmartEdgeSet?
@@ -66,12 +66,12 @@
 to dynamically attach data the to graph components.
 
-The following program demonstrates the basic features of HugoLib's graph
+The following program demonstrates the basic features of LEMON's graph
 structures.
 
 \code
 #include <iostream>
-#include <hugo/list_graph.h>
+#include <lemon/list_graph.h>
 
-using namespace hugo;
+using namespace lemon;
 
 int main()
@@ -80,5 +80,5 @@
 \endcode
 
-ListGraph is one of HugoLib's graph classes. It is based on linked lists,
+ListGraph is one of LEMON's graph classes. It is based on linked lists,
 therefore iterating throuh its edges and nodes is fast.
 
@@ -115,5 +115,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 hugo::INVALID "INVALID". This is what we exploit in the stop condition.
+\ref lemon::INVALID "INVALID". This is what we exploit in the stop condition.
 
 The previous code fragment prints out the following:
@@ -182,5 +182,5 @@
 
 As we mentioned above, graphs are not containers rather
-incidence structures which are iterable in many ways. HugoLib introduces
+incidence structures which are iterable in many ways. LEMON introduces
 concepts that allow us to attach containers to graphs. These containers are
 called maps.
