1.1 --- a/src/hugo/smart_graph.h	Fri Sep 17 15:11:39 2004 +0000
     1.2 +++ b/src/hugo/smart_graph.h	Fri Sep 17 15:51:50 2004 +0000
     1.3 @@ -30,9 +30,9 @@
     1.4    ///This is a simple and fast graph implementation.
     1.5    ///It is also quite memory efficient, but at the price
     1.6    ///that <b> it does not support node and edge deletion</b>.
     1.7 -  ///It conforms to the graph interface documented under
     1.8 -  ///the description of \ref GraphSkeleton.
     1.9 -  ///\sa \ref GraphSkeleton.
    1.10 +  ///It conforms to 
    1.11 +  ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept.
    1.12 +  ///\sa skeleton::ExtendableGraph.
    1.13    ///
    1.14    ///\todo Some member functions could be \c static.
    1.15    ///
    1.16 @@ -302,7 +302,7 @@
    1.17    ///that complements this
    1.18    ///feature by
    1.19    ///storing shared values for the edge pairs. The usual
    1.20 -  ///\ref GraphSkeleton::EdgeMap "EdgeMap"
    1.21 +  ///\ref Graph::EdgeMap "EdgeMap"
    1.22    ///can be used
    1.23    ///as well.
    1.24    ///
    1.25 @@ -310,7 +310,7 @@
    1.26    ///using \ref opposite.
    1.27    ///\warning It shares the similarity with \ref SmartGraph that
    1.28    ///it is not possible to delete edges or nodes from the graph.
    1.29 -  //\sa \ref SmartGraph.
    1.30 +  //\sa SmartGraph.
    1.31  
    1.32    class SymSmartGraph : public SmartGraph
    1.33    {