1.1 --- a/doc/graphs.dox	Mon Jun 26 15:40:35 2006 +0000
     1.2 +++ b/doc/graphs.dox	Wed Jun 28 15:06:24 2006 +0000
     1.3 @@ -2,23 +2,20 @@
     1.4  
     1.5  \page graphs Graphs
     1.6  
     1.7 +\todo Write a new Graphs page. I think it should be contain the Graph,
     1.8 +UGraph and BpUGraph concept. It should be describe the iterators and
     1.9 +the basic functions and the differences of the implementations.
    1.10 +
    1.11  The primary data structures of LEMON are the graph classes. They all
    1.12  provide a node list - edge list interface, i.e. they have
    1.13  functionalities to list the nodes and the edges of the graph as well
    1.14  as  incoming and outgoing edges of a given node. 
    1.15  
    1.16 +Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
    1.17 +This concept does not make it possible to change the graph (i.e. it is
    1.18 +not possible to add or delete edges or nodes). Most of the graph
    1.19 +algorithms will run on these graphs.
    1.20  
    1.21 -Each graph should meet the
    1.22 -\ref lemon::concept::StaticGraph "StaticGraph" concept.
    1.23 -This concept does not
    1.24 -make it possible to change the graph (i.e. it is not possible to add
    1.25 -or delete edges or nodes). Most of the graph algorithms will run on
    1.26 -these graphs.
    1.27 -
    1.28 -The graphs meeting the
    1.29 -\ref lemon::concept::ExtendableGraph "ExtendableGraph"
    1.30 -concept allow node and
    1.31 -edge addition. You can also "clear" such a graph (i.e. erase all edges and nodes ).
    1.32  
    1.33  In case of graphs meeting the full feature
    1.34  \ref lemon::concept::ErasableGraph "ErasableGraph"
    1.35 @@ -36,7 +33,7 @@
    1.36  so you cannot delete individual edges or nodes.
    1.37  \li \ref lemon::FullGraph "FullGraph"
    1.38  implements a complete graph. It is a
    1.39 -\ref lemon::concept::StaticGraph "StaticGraph", so you cannot
    1.40 +\ref lemon::concept::Graph "Graph", so you cannot
    1.41  change the number of nodes once it is constructed. It is extremely memory
    1.42  efficient: it uses constant amount of memory independently from the number of
    1.43  the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and