diff -r 4b8153513f34 -r ea1fa1bc3f6d doc/graphs.dox
--- a/doc/graphs.dox	Mon Jun 26 15:40:35 2006 +0000
+++ b/doc/graphs.dox	Wed Jun 28 15:06:24 2006 +0000
@@ -2,23 +2,20 @@
 
 \page graphs Graphs
 
+\todo Write a new Graphs page. I think it should be contain the Graph,
+UGraph and BpUGraph concept. It should be describe the iterators and
+the basic functions and the differences of the implementations.
+
 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
 as  incoming and outgoing edges of a given node. 
 
+Each graph should meet the \ref lemon::concept::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
+algorithms will run on these graphs.
 
-Each graph should meet the
-\ref lemon::concept::StaticGraph "StaticGraph" 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 algorithms will run on
-these graphs.
-
-The graphs meeting the
-\ref lemon::concept::ExtendableGraph "ExtendableGraph"
-concept allow node and
-edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).
 
 In case of graphs meeting the full feature
 \ref lemon::concept::ErasableGraph "ErasableGraph"
@@ -36,7 +33,7 @@
 so you cannot delete individual edges or nodes.
 \li \ref lemon::FullGraph "FullGraph"
 implements a complete graph. It is a
-\ref lemon::concept::StaticGraph "StaticGraph", so you cannot
+\ref lemon::concept::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
 the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and