1.1 --- a/doc/graphs.dox Wed Jun 28 16:27:44 2006 +0000
1.2 +++ b/doc/graphs.dox Fri Jun 30 12:14:36 2006 +0000
1.3 @@ -9,20 +9,20 @@
1.4 The primary data structures of LEMON are the graph classes. They all
1.5 provide a node list - edge list interface, i.e. they have
1.6 functionalities to list the nodes and the edges of the graph as well
1.7 -as incoming and outgoing edges of a given node.
1.8 +as incoming and outgoing edges of a given node. This functionalities
1.9 +are defined in the \ref lemon::concept::Graph "Graph" concept.
1.10
1.11 -Each graph should meet the \ref lemon::concept::Graph "Graph" concept.
1.12 -This concept does not make it possible to change the graph (i.e. it is
1.13 -not possible to add or delete edges or nodes). Most of the graph
1.14 -algorithms will run on these graphs.
1.15 +The next important graph type concept is the undirected graph concept
1.16 +what is defined in the \ref lemon::concept::UGraph "UGraph" concept class.
1.17 +Each undirected graphs provide node - undirected edge list interfaces.
1.18 +In addition the undirected graphs can be used as directed graphs so
1.19 +they are also conform to the \ref lemon::concept::Graph "Graph" concept.
1.20
1.21 +Usually the graphs can be sorted to two group, the first is the
1.22 +general topology graph types which can store any graph and the second
1.23 +are the special topology graphs like the \ref FullUGraph or the \ref
1.24 +GridUGraph.
1.25
1.26 -In case of graphs meeting the full feature
1.27 -\ref lemon::concept::ErasableGraph "ErasableGraph"
1.28 -concept
1.29 -you can also erase individual edges and nodes in arbitrary order.
1.30 -
1.31 -The implemented graph structures are the following.
1.32 \li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
1.33 the \ref lemon::concept::ErasableGraph "ErasableGraph" concept
1.34 and it also has some convenient extra features.