1.1 --- a/doc/graphs.dox	Mon Sep 27 18:11:27 2004 +0000
     1.2 +++ b/doc/graphs.dox	Tue Sep 28 07:00:58 2004 +0000
     1.3 @@ -28,7 +28,7 @@
     1.4  
     1.5  The implemented graph structures are the following.
     1.6  \li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
     1.7 -the hugo::skeleton::ErasableGraph "ErasableGraph" concept
     1.8 +the \ref hugo::skeleton::ErasableGraph "ErasableGraph" concept
     1.9  and it also have some convenience features.
    1.10  \li \ref hugo::SmartGraph "SmartGraph" is a more memory
    1.11  efficient version of \ref hugo::ListGraph "ListGraph". The
    1.12 @@ -45,7 +45,7 @@
    1.13  attach data to the edges in such a way that the stored data
    1.14  are shared by the edge pairs. 
    1.15  \li \ref hugo::FullGraph "FullGraph"
    1.16 -implements a full graph. It is a \ref ConstGraph, so you cannot
    1.17 +implements a full graph. It is a \ref hugo::skeleton::StaticGraph, so you cannot
    1.18  change the number of nodes once it is constructed. It is extremely memory
    1.19  efficient: it uses constant amount of memory independently from the number of
    1.20  the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and