# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1266179539 -3600
# Node ID a40eafb6066db350e17348113b4946037828523e
# Parent  66d164ef72d16a2f8b6dedfa28b6294957978085
Distinguish section names from the doc groups

diff -r 66d164ef72d1 -r a40eafb6066d basics.dox
--- a/basics.dox	Sun Feb 14 21:26:31 2010 +0100
+++ b/basics.dox	Sun Feb 14 21:32:19 2010 +0100
@@ -18,7 +18,7 @@
 
 namespace lemon {
 /**
-[PAGE]basics[PAGE] Basic Concepts
+[PAGE]sec_basics[PAGE] Basic Concepts
 
 Throughout the document we are working with the \ref lemon namespace.
 To save a lot of typing we assume that a
@@ -29,7 +29,7 @@
 
 directive is added to the code at the beginning.
 
-[SEC]digraphs[SEC] Directed Graphs
+[SEC]sec_digraphs[SEC] Directed Graphs
 
 This section tells you how to work with a directed graph. We use ListDigraph,
 the most versatile graph structure.
@@ -72,7 +72,8 @@
     std::cout << "This is a loop arc" << std::endl;
 \endcode
 
-[SEC]digraphs_it[SEC] Iterators
+
+[SEC]sec_digraph_it[SEC] Iterators
 
 Now assume you want to list the elements of the graph. For this purpose the
 the graphs provides several iterators. For example for following code will
@@ -142,7 +143,8 @@
   std::cout << "Number of arcs leaving the node 'start': " << cnt << std::endl;
 \endcode
 
-[SEC]maps[SEC] Maps
+
+[SEC]sec_digraph_maps[SEC] Maps
 
 The concept of "Maps" is another fundamental part of LEMON. They allow assigning
 values of any type to the nodes or arcs of a graph. The default maps
diff -r 66d164ef72d1 -r a40eafb6066d getting_started.dox
--- a/getting_started.dox	Sun Feb 14 21:26:31 2010 +0100
+++ b/getting_started.dox	Sun Feb 14 21:32:19 2010 +0100
@@ -18,7 +18,7 @@
 
 namespace lemon {
 /**
-[PAGE]hello_lemon[PAGE] Compile Your First Code
+[PAGE]sec_hello_lemon[PAGE] Compile Your First Code
 
 First of all, you have to install LEMON on your system (see the
 <a href="http://lemon.cs.elte.hu/trac/lemon/wiki/InstallGuide"><b>Installation
diff -r 66d164ef72d1 -r a40eafb6066d intro.dox
--- a/intro.dox	Sun Feb 14 21:26:31 2010 +0100
+++ b/intro.dox	Sun Feb 14 21:32:19 2010 +0100
@@ -17,9 +17,9 @@
  */
 
 /**
-[PAGE]intro[PAGE] Introduction
+[PAGE]sec_intro[PAGE] Introduction
 
-[SEC]intro_lemon[SEC] What is LEMON
+[SEC]sec_intro_lemon[SEC] What is LEMON
 
 <b>LEMON</b> stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling and
 <b>O</b>ptimization in <b>N</b>etworks. It is a C++ template library providing
@@ -43,7 +43,7 @@
 For more information, visit the LEMON web site:
 <a href="http://lemon.cs.elte.hu/"><b>http://lemon.cs.elte.hu/</b></a>.
 
-[SEC]intro_tutorial[SEC] LEMON Tutorial
+[SEC]sec_intro_tutorial[SEC] LEMON Tutorial
 
 This tutorial introduces the reader to the basic concepts and features of
 LEMON, and there are also some sections about advanced topics showing the
diff -r 66d164ef72d1 -r a40eafb6066d license.dox
--- a/license.dox	Sun Feb 14 21:26:31 2010 +0100
+++ b/license.dox	Sun Feb 14 21:32:19 2010 +0100
@@ -18,7 +18,7 @@
 
 /**
 
-[PAGE]license[PAGE] License Terms
+[PAGE]sec_license[PAGE] License Terms
 
 \verbinclude ./LICENSE
 
diff -r 66d164ef72d1 -r a40eafb6066d mainpage.dox
--- a/mainpage.dox	Sun Feb 14 21:26:31 2010 +0100
+++ b/mainpage.dox	Sun Feb 14 21:32:19 2010 +0100
@@ -20,7 +20,7 @@
 /**
 \mainpage LEMON Tutorial
 
-\section toc Table of Contents
+\section sec_toc Table of Contents
 
 [TOC]
 
diff -r 66d164ef72d1 -r a40eafb6066d scripts/titlegen.py
--- a/scripts/titlegen.py	Sun Feb 14 21:26:31 2010 +0100
+++ b/scripts/titlegen.py	Sun Feb 14 21:32:19 2010 +0100
@@ -66,7 +66,7 @@
                     next_str= ( ' \\ref '+next_page+' >>')
                 else:
                     next_str=''
-                fo.write('%s| \\ref toc "Home" |%s\n'%\
+                fo.write('%s| \\ref sec_toc "Home" |%s\n'%\
                              (prev_str,next_str))
             elif gr[3]:
                 secs = [ x for x in toc]
diff -r 66d164ef72d1 -r a40eafb6066d toc.txt
--- a/toc.txt	Sun Feb 14 21:26:31 2010 +0100
+++ b/toc.txt	Sun Feb 14 21:32:19 2010 +0100
@@ -1,23 +1,21 @@
-* intro
-** intro_lemon
-** intro_tutorial
-* hello_lemon
-* basics
-** digraphs
-*** digraphs_it
-*** maps
-*_digraph_build
-*_digraph_iterate
-*_standard_maps
-*_algorithms
-**_alg_bfs_dfs
-**_alg_dijkstra
-**_alg_kruskal
-*_undir_graphs
-*_tools
-**_lgf
-**_glemon
-**_graph_to_eps
-**_time_count
-**_random
-* license
+* sec_intro
+** sec_intro_lemon
+** sec_intro_tutorial
+* sec_hello_lemon
+* sec_basics
+** sec_digraphs
+*** sec_digraph_it
+*** sec_digraph_maps
+*_sec_algorithms
+**_sec_alg_graph_search
+**_sec_alg_shortest_paths
+**_sec_alg_spanning_tree
+**_sec_alg_max_flow
+*_sec_undir_graphs
+*_sec_tools
+**_sec_lgf
+**_sec_time_count
+**_sec_random
+**_sec_graph_to_eps
+**_sec_glemon
+* sec_license