1.1 --- a/src/hugo/list_graph.h	Thu Sep 09 09:18:41 2004 +0000
     1.2 +++ b/src/hugo/list_graph.h	Thu Sep 09 09:24:16 2004 +0000
     1.3 @@ -30,8 +30,9 @@
     1.4    ///This is a simple and fast erasable graph implementation.
     1.5    ///
     1.6    ///It conforms to the graph interface documented under
     1.7 -  ///the description of \ref ErasableGraphSkeleton.
     1.8 -  ///\sa \ref ErasableGraphSkeleton.
     1.9 +  ///the description of
    1.10 +  ///\ref skeleton::ErasableGraphSkeleton "ErasableGraphSkeleton".
    1.11 +  ///\sa skeleton::ErasableGraphSkeleton.
    1.12    class ListGraph {
    1.13  
    1.14      //Nodes are double linked.
    1.15 @@ -77,6 +78,9 @@
    1.16      /// Creating map registries.
    1.17      CREATE_MAP_REGISTRIES;
    1.18      /// Creating node and edge maps.
    1.19 +
    1.20 +    /// \todo
    1.21 +    /// It apears in the documentation as if it were a function definition.
    1.22      CREATE_MAPS(DefaultMap);
    1.23  
    1.24    public: