1.1 --- a/src/work/deba/list_graph.h	Fri Sep 17 15:11:39 2004 +0000
     1.2 +++ b/src/work/deba/list_graph.h	Fri Sep 17 15:51:50 2004 +0000
     1.3 @@ -27,8 +27,8 @@
     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 GraphSkeleton.
     1.8 -  ///\sa \ref GraphSkeleton.
     1.9 +  ///the description of \ref Graph.
    1.10 +  ///\sa \ref Graph.
    1.11    class ListGraph {
    1.12  
    1.13      //Nodes are double linked.
    1.14 @@ -382,7 +382,7 @@
    1.15    ///that complements this
    1.16    ///feature by
    1.17    ///storing shared values for the edge pairs. The usual
    1.18 -  ///\ref GraphSkeleton::EdgeMap "EdgeMap"
    1.19 +  ///\ref Graph::EdgeMap "EdgeMap"
    1.20    ///can be used
    1.21    ///as well.
    1.22    ///