1.1 --- a/doc/graphs.dox	Thu Sep 16 19:18:18 2004 +0000
     1.2 +++ b/doc/graphs.dox	Thu Sep 16 19:23:41 2004 +0000
     1.3 @@ -8,24 +8,32 @@
     1.4  as in incoming and outgoing edges of a given node. 
     1.5  
     1.6  
     1.7 -Each graph should meet the \ref ConstGraph concept. This concept does
     1.8 +Each graph should meet the
     1.9 +\ref hugo::skeleton::StaticGraphSkeleton "StaticGraph" concept.
    1.10 +This concept does not
    1.11  makes it possible to change the graph (i.e. it is not possible to add
    1.12  or delete edges or nodes). Most of the graph algorithms will run on
    1.13  these graphs.
    1.14  
    1.15 -The graphs meeting the \ref ExtendableGraph concept allow node and
    1.16 +The graphs meeting the
    1.17 +\ref hugo::skeleton::ExtendableGraphSkeleton "ExtendableGraph"
    1.18 +concept allow node and
    1.19  edge addition. You can also "clear" (i.e. erase all edges and nodes)
    1.20  such a graph.
    1.21  
    1.22 -In case of graphs meeting the full feature \ref ErasableGraph concept
    1.23 +In case of graphs meeting the full feature
    1.24 +\ref hugo::skeleton::ErasableGraphSkeleton "ErasableGraph"
    1.25 +concept
    1.26  you can also erase individual edges and node in arbitrary order.
    1.27  
    1.28  The implemented graph structures are the following.
    1.29  \li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
    1.30 -the ErasableGraph concept and it also have some convenience features.
    1.31 +the hugo::skeleton::ErasableGraphSkeleton "ErasableGraph" concept
    1.32 +and it also have some convenience features.
    1.33  \li \ref hugo::SmartGraph "SmartGraph" is a more memory
    1.34  efficient version of \ref hugo::ListGraph "ListGraph". The
    1.35 -price of it is that it only meets the \ref ExtendableGraph concept,
    1.36 +price of it is that it only meets the
    1.37 +\ref hugo::skeleton::ExtendableGraphSkeleton "ExtendableGraph" concept,
    1.38  so you cannot delete individual edges or nodes.
    1.39  \li \ref hugo::SymListGraph "SymListGraph" and
    1.40  \ref hugo::SymSmartGraph "SymSmartGraph" classes are very similar to
    1.41 @@ -46,22 +54,19 @@
    1.42  \li \ref hugo::NodeSet "NodeSet" implements a graph with no edges. This class
    1.43  can be used as a base class of \ref hugo::EdgeSet "EdgeSet".
    1.44  \li \ref hugo::EdgeSet "EdgeSet" can be used to create a new graph on
    1.45 -the edge set of another graph. The base graph can be an arbitrary graph and it
    1.46 +the node set of another graph. The base graph can be an arbitrary graph and it
    1.47  is possible to attach several \ref hugo::EdgeSet "EdgeSet"'s to a base graph.
    1.48  
    1.49  \todo Don't we need SmartNodeSet and SmartEdgeSet?
    1.50  \todo Some cross-refs are wrong.
    1.51  
    1.52 -\bug This file must be updated accordig to the new stile iterators.
    1.53 +\bug This file must be updated accordig to the new style iterators.
    1.54  
    1.55  The graph structures itself can not store data attached
    1.56  to the edges and nodes. However they all provide
    1.57  \ref maps "map classes"
    1.58  to dynamically attach data the to graph components.
    1.59  
    1.60 -
    1.61 -
    1.62 -
    1.63  The following program demonstrates the basic features of HugoLib's graph
    1.64  structures.
    1.65  
    1.66 @@ -190,7 +195,7 @@
    1.67  1  (2,0) 9
    1.68  \endcode
    1.69  
    1.70 -In generic graph optimization programming graphs are not containers rather
    1.71 +As we mentioned above, graphs are not containers rather
    1.72  incidence structures which are iterable in many ways. HugoLib introduces
    1.73  concepts that allow us to attach containers to graphs. These containers are
    1.74  called maps.