1.1 --- a/doc/graphs.dox	Mon Jan 03 16:21:33 2005 +0000
     1.2 +++ b/doc/graphs.dox	Mon Jan 03 16:23:47 2005 +0000
     1.3 @@ -48,8 +48,8 @@
     1.4  implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot
     1.5  change the number of nodes once it is constructed. It is extremely memory
     1.6  efficient: it uses constant amount of memory independently from the number of
     1.7 -the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and
     1.8 -\ref maps "EdgeMap"'s will depend on the number of nodes.
     1.9 +the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and
    1.10 +\ref maps-page "EdgeMap"'s will depend on the number of nodes.
    1.11  
    1.12  \li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class
    1.13  can be used as a base class of \ref lemon::EdgeSet "EdgeSet".
    1.14 @@ -62,7 +62,7 @@
    1.15  
    1.16  The graph structures itself can not store data attached
    1.17  to the edges and nodes. However they all provide
    1.18 -\ref maps "map classes"
    1.19 +\ref maps-page "map classes"
    1.20  to dynamically attach data the to graph components.
    1.21  
    1.22  The following program demonstrates the basic features of LEMON's graph
    1.23 @@ -190,6 +190,6 @@
    1.24  into the map and the operator[] to retrieve them.
    1.25  
    1.26  Here we used the maps provided by the ListGraph class, but you can also write
    1.27 -your own maps. You can read more about using maps \ref maps "here".
    1.28 +your own maps. You can read more about using maps \ref maps-page "here".
    1.29  
    1.30  */