diff -r 5e284075b193 -r 9d0bfd35b97c src/work/deba/list_graph.h
--- a/src/work/deba/list_graph.h	Fri Sep 17 15:11:39 2004 +0000
+++ b/src/work/deba/list_graph.h	Fri Sep 17 15:51:50 2004 +0000
@@ -27,8 +27,8 @@
   ///This is a simple and fast erasable graph implementation.
   ///
   ///It conforms to the graph interface documented under
-  ///the description of \ref GraphSkeleton.
-  ///\sa \ref GraphSkeleton.
+  ///the description of \ref Graph.
+  ///\sa \ref Graph.
   class ListGraph {
 
     //Nodes are double linked.
@@ -382,7 +382,7 @@
   ///that complements this
   ///feature by
   ///storing shared values for the edge pairs. The usual
-  ///\ref GraphSkeleton::EdgeMap "EdgeMap"
+  ///\ref Graph::EdgeMap "EdgeMap"
   ///can be used
   ///as well.
   ///