1.1 --- a/graphs.dox	Mon Feb 22 02:03:25 2010 +0100
     1.2 +++ b/graphs.dox	Mon Feb 22 13:00:14 2010 +0100
     1.3 @@ -81,27 +81,23 @@
     1.4  provides faster item iteration than \ref ListDigraph and \ref
     1.5  SmartDigraph, especially using \ref concepts::Digraph::OutArcIt
     1.6  "OutArcIt" iterators, since its arcs are stored in an appropriate order.
     1.7 -However, it only provides \ref StaticDigraph::build() "build()" and
     1.8 -\ref \ref StaticDigraph::clear() "clear()" functions and does not
     1.9 -support any other modification of the digraph.
    1.10 +However, you can neither add nor delete arcs or nodes, the graph
    1.11 +has to be built at once and other modifications are not supported.
    1.12   
    1.13  \ref FullDigraph is an efficient implementation of a directed full graph.
    1.14 -This structure is also completely static, so you can neither add nor delete
    1.15 -arcs or nodes, moreover, the class needs constant space in memory.
    1.16 +This structure is also completely static and it needs constant space
    1.17 +in memory.
    1.18  
    1.19  
    1.20  [SEC]sec_graph_types[SEC] Undirected Graph Structures
    1.21  
    1.22  The general undirected graph classes, \ref ListGraph and \ref SmartGraph
    1.23  have similar implementations as their directed variants.
    1.24 -Therefore, \ref SmartDigraph is more efficient, but \ref ListGraph provides
    1.25 +Therefore, \ref SmartGraph is more efficient, but \ref ListGraph provides
    1.26  more functionality.
    1.27 -
    1.28  In addition to these general structures, LEMON also provides special purpose
    1.29  undirected graph types for handling \ref FullGraph "full graphs",
    1.30  \ref GridGraph "grid graphs" and \ref HypercubeGraph "hypercube graphs".
    1.31 -They all static structures, i.e. they do not allow distinct item additions
    1.32 -or deletions, the graph has to be built at once.
    1.33  
    1.34  [TRAILER]
    1.35  */