diff -r 5a89cacf17f1 -r 89a4fbb99cad doc/graphs.dox
--- a/doc/graphs.dox	Mon Sep 27 18:11:27 2004 +0000
+++ b/doc/graphs.dox	Tue Sep 28 07:00:58 2004 +0000
@@ -28,7 +28,7 @@
 
 The implemented graph structures are the following.
 \li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
-the hugo::skeleton::ErasableGraph "ErasableGraph" concept
+the \ref hugo::skeleton::ErasableGraph "ErasableGraph" concept
 and it also have some convenience features.
 \li \ref hugo::SmartGraph "SmartGraph" is a more memory
 efficient version of \ref hugo::ListGraph "ListGraph". The
@@ -45,7 +45,7 @@
 attach data to the edges in such a way that the stored data
 are shared by the edge pairs. 
 \li \ref hugo::FullGraph "FullGraph"
-implements a full graph. It is a \ref ConstGraph, so you cannot
+implements a full graph. It is a \ref hugo::skeleton::StaticGraph, 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 "NodeMap"'s and