1.1 --- a/basics.dox	Sun Feb 14 22:19:50 2010 +0100
     1.2 +++ b/basics.dox	Mon Feb 15 00:36:27 2010 +0100
     1.3 @@ -32,9 +32,9 @@
     1.4  [SEC]sec_digraphs[SEC] Directed Graphs
     1.5  
     1.6  This section tells you how to work with a directed graph (\e digraph,
     1.7 -for short) in LEMON.
     1.8 -The library provides various digraph structures for both general and special
     1.9 -purposes. Here we use \c ListDigraph, the most versatile digraph type.
    1.10 +for short) in LEMON. Here we use \ref ListDigraph, the most versatile
    1.11 +digraph structure. (The library also provides other digraph types,
    1.12 +see \ref sec_graph_structures "later".)
    1.13  
    1.14  The nodes and the arcs of a graph are identified by two data types called
    1.15  \ref concepts::Digraph::Node "ListDigraph::Node" and \ref concepts::Digraph::Arc
    1.16 @@ -62,9 +62,11 @@
    1.17  \endcode
    1.18  
    1.19  \note Using ListDigraph, you can also remove nodes or arcs with the
    1.20 -\ref ListDigraph::erase() "erase()" function.
    1.21 +\ref ListDigraph::erase() "erase()" function. Moreover, this class provides
    1.22 +several other operations, see its \ref ListDigraph "documentation" for more
    1.23 +information.
    1.24  However, not all graph structures support the addition and deletion
    1.25 -of graph items.
    1.26 +of graph items (see \ref sec_graph_concepts).
    1.27  
    1.28  Two important member functions of the directed graphs are
    1.29  \ref concepts::Digraph::source() "source()"