1.1 --- a/doc/graphs.dox	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/doc/graphs.dox	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -11,29 +11,29 @@
     1.4  functionalities to list the nodes and the edges of the graph as well
     1.5  as  incoming and outgoing edges of a given node. 
     1.6  
     1.7 -Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
     1.8 +Each graph should meet the \ref lemon::concepts::Graph "Graph" concept.
     1.9  This concept does not make it possible to change the graph (i.e. it is
    1.10  not possible to add or delete edges or nodes). Most of the graph
    1.11  algorithms will run on these graphs.
    1.12  
    1.13  
    1.14  In case of graphs meeting the full feature
    1.15 -\ref lemon::concept::ErasableGraph "ErasableGraph"
    1.16 +\ref lemon::concepts::ErasableGraph "ErasableGraph"
    1.17  concept
    1.18  you can also erase individual edges and nodes in arbitrary order.
    1.19  
    1.20  The implemented graph structures are the following.
    1.21  \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    1.22 -the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
    1.23 +the \ref lemon::concepts::ErasableGraph "ErasableGraph" concept
    1.24  and it also has some convenient extra features.
    1.25  \li \ref lemon::SmartGraph "SmartGraph" is a more memory
    1.26  efficient version of \ref lemon::ListGraph "ListGraph". The
    1.27  price of this is that it only meets the
    1.28 -\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
    1.29 +\ref lemon::concepts::ExtendableGraph "ExtendableGraph" concept,
    1.30  so you cannot delete individual edges or nodes.
    1.31  \li \ref lemon::FullGraph "FullGraph"
    1.32  implements a complete graph. It is a
    1.33 -\ref lemon::concept::Graph "Graph", so you cannot
    1.34 +\ref lemon::concepts::Graph "Graph", so you cannot
    1.35  change the number of nodes once it is constructed. It is extremely memory
    1.36  efficient: it uses constant amount of memory independently from the number of
    1.37  the nodes of the graph. Of course, the size of the \ref maps-page "NodeMap"'s and