diff -r 056fbb112b30 -r 6433f69dfc6b src/hugo/list_graph.h
--- a/src/hugo/list_graph.h	Thu Sep 09 09:18:41 2004 +0000
+++ b/src/hugo/list_graph.h	Thu Sep 09 09:24:16 2004 +0000
@@ -30,8 +30,9 @@
   ///This is a simple and fast erasable graph implementation.
   ///
   ///It conforms to the graph interface documented under
-  ///the description of \ref ErasableGraphSkeleton.
-  ///\sa \ref ErasableGraphSkeleton.
+  ///the description of
+  ///\ref skeleton::ErasableGraphSkeleton "ErasableGraphSkeleton".
+  ///\sa skeleton::ErasableGraphSkeleton.
   class ListGraph {
 
     //Nodes are double linked.
@@ -77,6 +78,9 @@
     /// Creating map registries.
     CREATE_MAP_REGISTRIES;
     /// Creating node and edge maps.
+
+    /// \todo
+    /// It apears in the documentation as if it were a function definition.
     CREATE_MAPS(DefaultMap);
 
   public: