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
2.1 --- a/getting_started.dox Sun Feb 14 21:26:31 2010 +0100
2.2 +++ b/getting_started.dox Sun Feb 14 21:32:19 2010 +0100
2.3 @@ -18,7 +18,7 @@
2.4
2.5 namespace lemon {
2.6 /**
2.7 -[PAGE]hello_lemon[PAGE] Compile Your First Code
2.8 +[PAGE]sec_hello_lemon[PAGE] Compile Your First Code
2.9
2.10 First of all, you have to install LEMON on your system (see the
2.11 <a href="http://lemon.cs.elte.hu/trac/lemon/wiki/InstallGuide"><b>Installation
3.1 --- a/intro.dox Sun Feb 14 21:26:31 2010 +0100
3.2 +++ b/intro.dox Sun Feb 14 21:32:19 2010 +0100
3.3 @@ -17,9 +17,9 @@
3.4 */
3.5
3.6 /**
3.7 -[PAGE]intro[PAGE] Introduction
3.8 +[PAGE]sec_intro[PAGE] Introduction
3.9
3.10 -[SEC]intro_lemon[SEC] What is LEMON
3.11 +[SEC]sec_intro_lemon[SEC] What is LEMON
3.12
3.13 <b>LEMON</b> stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling and
3.14 <b>O</b>ptimization in <b>N</b>etworks. It is a C++ template library providing
3.15 @@ -43,7 +43,7 @@
3.16 For more information, visit the LEMON web site:
3.17 <a href="http://lemon.cs.elte.hu/"><b>http://lemon.cs.elte.hu/</b></a>.
3.18
3.19 -[SEC]intro_tutorial[SEC] LEMON Tutorial
3.20 +[SEC]sec_intro_tutorial[SEC] LEMON Tutorial
3.21
3.22 This tutorial introduces the reader to the basic concepts and features of
3.23 LEMON, and there are also some sections about advanced topics showing the
4.1 --- a/license.dox Sun Feb 14 21:26:31 2010 +0100
4.2 +++ b/license.dox Sun Feb 14 21:32:19 2010 +0100
4.3 @@ -18,7 +18,7 @@
4.4
4.5 /**
4.6
4.7 -[PAGE]license[PAGE] License Terms
4.8 +[PAGE]sec_license[PAGE] License Terms
4.9
4.10 \verbinclude ./LICENSE
4.11
5.1 --- a/mainpage.dox Sun Feb 14 21:26:31 2010 +0100
5.2 +++ b/mainpage.dox Sun Feb 14 21:32:19 2010 +0100
5.3 @@ -20,7 +20,7 @@
5.4 /**
5.5 \mainpage LEMON Tutorial
5.6
5.7 -\section toc Table of Contents
5.8 +\section sec_toc Table of Contents
5.9
5.10 [TOC]
5.11
6.1 --- a/scripts/titlegen.py Sun Feb 14 21:26:31 2010 +0100
6.2 +++ b/scripts/titlegen.py Sun Feb 14 21:32:19 2010 +0100
6.3 @@ -66,7 +66,7 @@
6.4 next_str= ( ' \\ref '+next_page+' >>')
6.5 else:
6.6 next_str=''
6.7 - fo.write('%s| \\ref toc "Home" |%s\n'%\
6.8 + fo.write('%s| \\ref sec_toc "Home" |%s\n'%\
6.9 (prev_str,next_str))
6.10 elif gr[3]:
6.11 secs = [ x for x in toc]
7.1 --- a/toc.txt Sun Feb 14 21:26:31 2010 +0100
7.2 +++ b/toc.txt Sun Feb 14 21:32:19 2010 +0100
7.3 @@ -1,23 +1,21 @@
7.4 -* intro
7.5 -** intro_lemon
7.6 -** intro_tutorial
7.7 -* hello_lemon
7.8 -* basics
7.9 -** digraphs
7.10 -*** digraphs_it
7.11 -*** maps
7.12 -*_digraph_build
7.13 -*_digraph_iterate
7.14 -*_standard_maps
7.15 -*_algorithms
7.16 -**_alg_bfs_dfs
7.17 -**_alg_dijkstra
7.18 -**_alg_kruskal
7.19 -*_undir_graphs
7.20 -*_tools
7.21 -**_lgf
7.22 -**_glemon
7.23 -**_graph_to_eps
7.24 -**_time_count
7.25 -**_random
7.26 -* license
7.27 +* sec_intro
7.28 +** sec_intro_lemon
7.29 +** sec_intro_tutorial
7.30 +* sec_hello_lemon
7.31 +* sec_basics
7.32 +** sec_digraphs
7.33 +*** sec_digraph_it
7.34 +*** sec_digraph_maps
7.35 +*_sec_algorithms
7.36 +**_sec_alg_graph_search
7.37 +**_sec_alg_shortest_paths
7.38 +**_sec_alg_spanning_tree
7.39 +**_sec_alg_max_flow
7.40 +*_sec_undir_graphs
7.41 +*_sec_tools
7.42 +**_sec_lgf
7.43 +**_sec_time_count
7.44 +**_sec_random
7.45 +**_sec_graph_to_eps
7.46 +**_sec_glemon
7.47 +* sec_license