1.1 --- a/doc/graphs.dox	Thu Nov 04 18:52:31 2004 +0000
     1.2 +++ b/doc/graphs.dox	Thu Nov 04 20:24:59 2004 +0000
     1.3 @@ -9,31 +9,31 @@
     1.4  
     1.5  
     1.6  Each graph should meet the
     1.7 -\ref lemon::skeleton::StaticGraph "StaticGraph" concept.
     1.8 +\ref lemon::concept::StaticGraph "StaticGraph" concept.
     1.9  This concept does not
    1.10  makes it possible to change the graph (i.e. it is not possible to add
    1.11  or delete edges or nodes). Most of the graph algorithms will run on
    1.12  these graphs.
    1.13  
    1.14  The graphs meeting the
    1.15 -\ref lemon::skeleton::ExtendableGraph "ExtendableGraph"
    1.16 +\ref lemon::concept::ExtendableGraph "ExtendableGraph"
    1.17  concept allow node and
    1.18  edge addition. You can also "clear" (i.e. erase all edges and nodes)
    1.19  such a graph.
    1.20  
    1.21  In case of graphs meeting the full feature
    1.22 -\ref lemon::skeleton::ErasableGraph "ErasableGraph"
    1.23 +\ref lemon::concept::ErasableGraph "ErasableGraph"
    1.24  concept
    1.25  you can also erase individual edges and node in arbitrary order.
    1.26  
    1.27  The implemented graph structures are the following.
    1.28  \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
    1.29 -the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept
    1.30 +the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
    1.31  and it also have some convenience features.
    1.32  \li \ref lemon::SmartGraph "SmartGraph" is a more memory
    1.33  efficient version of \ref lemon::ListGraph "ListGraph". The
    1.34  price of it is that it only meets the
    1.35 -\ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept,
    1.36 +\ref lemon::concept::ExtendableGraph "ExtendableGraph" concept,
    1.37  so you cannot delete individual edges or nodes.
    1.38  \li \ref lemon::SymListGraph "SymListGraph" and
    1.39  \ref lemon::SymSmartGraph "SymSmartGraph" classes are very similar to
    1.40 @@ -45,7 +45,7 @@
    1.41  attach data to the edges in such a way that the stored data
    1.42  are shared by the edge pairs. 
    1.43  \li \ref lemon::FullGraph "FullGraph"
    1.44 -implements a full graph. It is a \ref lemon::skeleton::StaticGraph, so you cannot
    1.45 +implements a full graph. It is a \ref lemon::concept::StaticGraph, so you cannot
    1.46  change the number of nodes once it is constructed. It is extremely memory
    1.47  efficient: it uses constant amount of memory independently from the number of
    1.48  the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and