1.1 --- a/doc/graphs.dox	Tue Aug 16 16:44:57 2005 +0000
     1.2 +++ b/doc/graphs.dox	Tue Aug 16 19:06:59 2005 +0000
     1.3 @@ -34,15 +34,6 @@
     1.4  price of this is that it only meets the
     1.5  \ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
     1.6  so you cannot delete individual edges or nodes.
     1.7 -\li \ref lemon::SymListGraph "SymListGraph" and
     1.8 -\ref lemon::SymSmartGraph "SymSmartGraph" classes are very similar to
     1.9 -\ref lemon::ListGraph "ListGraph" and \ref lemon::SmartGraph "SmartGraph".
    1.10 -The difference is that whenever you add a
    1.11 -new edge to the graph, it actually adds a pair of oppositely directed edges.
    1.12 -They are linked together so it is possible to access the counterpart of an
    1.13 -edge. An even more important feature is that using these classes you can also
    1.14 -attach data to the edges in such a way that the stored data
    1.15 -are shared by the edge pairs. 
    1.16  \li \ref lemon::FullGraph "FullGraph"
    1.17  implements a complete graph. It is a
    1.18  \ref lemon::concept::StaticGraph "StaticGraph", so you cannot