1.1 --- a/basics.dox	Sun Feb 14 21:26:31 2010 +0100
     1.2 +++ b/basics.dox	Sun Feb 14 21:32:19 2010 +0100
     1.3 @@ -18,7 +18,7 @@
     1.4  
     1.5  namespace lemon {
     1.6  /**
     1.7 -[PAGE]basics[PAGE] Basic Concepts
     1.8 +[PAGE]sec_basics[PAGE] Basic Concepts
     1.9  
    1.10  Throughout the document we are working with the \ref lemon namespace.
    1.11  To save a lot of typing we assume that a
    1.12 @@ -29,7 +29,7 @@
    1.13  
    1.14  directive is added to the code at the beginning.
    1.15  
    1.16 -[SEC]digraphs[SEC] Directed Graphs
    1.17 +[SEC]sec_digraphs[SEC] Directed Graphs
    1.18  
    1.19  This section tells you how to work with a directed graph. We use ListDigraph,
    1.20  the most versatile graph structure.
    1.21 @@ -72,7 +72,8 @@
    1.22      std::cout << "This is a loop arc" << std::endl;
    1.23  \endcode
    1.24  
    1.25 -[SEC]digraphs_it[SEC] Iterators
    1.26 +
    1.27 +[SEC]sec_digraph_it[SEC] Iterators
    1.28  
    1.29  Now assume you want to list the elements of the graph. For this purpose the
    1.30  the graphs provides several iterators. For example for following code will
    1.31 @@ -142,7 +143,8 @@
    1.32    std::cout << "Number of arcs leaving the node 'start': " << cnt << std::endl;
    1.33  \endcode
    1.34  
    1.35 -[SEC]maps[SEC] Maps
    1.36 +
    1.37 +[SEC]sec_digraph_maps[SEC] Maps
    1.38  
    1.39  The concept of "Maps" is another fundamental part of LEMON. They allow assigning
    1.40  values of any type to the nodes or arcs of a graph. The default maps