1.1 --- a/src/hugo/list_graph.h	Mon Sep 27 18:11:27 2004 +0000
     1.2 +++ b/src/hugo/list_graph.h	Tue Sep 28 07:00:58 2004 +0000
     1.3 @@ -421,16 +421,16 @@
     1.4    ///having bidirectional edges. Here the function \c addEdge(u,v) adds a pair
     1.5    ///of oppositely directed edges.
     1.6    ///There is a new edge map type called
     1.7 -  ///\ref SymListGraph::SymEdgeMap "SymEdgeMap"
     1.8 +  ///\ref hugo::SymListGraph::SymEdgeMap "SymEdgeMap"
     1.9    ///that complements this
    1.10    ///feature by
    1.11    ///storing shared values for the edge pairs. The usual
    1.12 -  ///\ref Graph::EdgeMap "EdgeMap"
    1.13 +  ///\ref hugo::skeleton::StaticGraph::EdgeMap "EdgeMap"
    1.14    ///can be used
    1.15    ///as well.
    1.16    ///
    1.17    ///The oppositely directed edge can also be obtained easily
    1.18 -  ///using \ref opposite.
    1.19 +  ///using \ref hugo::SymListGraph::opposite() "opposite()" member function.
    1.20    ///
    1.21    ///Here erase(Edge) deletes a pair of edges.
    1.22    ///