1.1 --- a/demo/kruskal_demo.cc	Tue Oct 31 08:46:18 2006 +0000
     1.2 +++ b/demo/kruskal_demo.cc	Tue Oct 31 09:32:44 2006 +0000
     1.3 @@ -106,13 +106,12 @@
     1.4  
     1.5    int k=0;
     1.6    std::cout << "The edges of the tree:" ;
     1.7 -  for(EdgeIt i(g); i!=INVALID; ++i){
     1.8 -
     1.9 +  for(EdgeIt i(g); i!=INVALID; ++i)
    1.10      if (tree_map[i]) { 
    1.11        std::cout << g.id(i) <<";";
    1.12        ++k;
    1.13      }
    1.14 -  }
    1.15 +
    1.16    std::cout << std::endl;
    1.17    std::cout << "The size of the tree is: "<< k << std::endl;
    1.18  

     2.1 --- a/doc/algorithms.dox	Tue Oct 31 08:46:18 2006 +0000
     2.2 +++ b/doc/algorithms.dox	Tue Oct 31 09:32:44 2006 +0000
     2.3 @@ -94,11 +94,15 @@
     2.4  \dontinclude topological_ordering.cc
     2.5  First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering
     2.6  will be done through it.
     2.7 -\skip SerializingWriteMap
     2.8 +\skip MyOrdererMap
     2.9  \until };
    2.10  The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing
    2.11  we need to do is insert the key - that is the node who's processing just finished - into the beginning
    2.12 -of the list.
    2.13 +of the list.<br>
    2.14 +Although we implemented this needed helper class ourselves it was not necessary.
    2.15 +The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly
    2.16 +what we needed. To be correct it's more general - and it's all in \c LEMON. But
    2.17 +we wanted to show you, how easy is to add additional functionality.
    2.18  
    2.19  First we declare the needed data structures: the graph and a map to store the nodes' label.
    2.20  \skip ListGraph
    2.21 @@ -126,5 +130,7 @@
    2.22  \until endl
    2.23  
    2.24  The program is to be found in the \ref demo directory: \ref topological_ordering.cc
    2.25 +
    2.26 +More algorithms are described in the \ref algorithms2 "second part".
    2.27  */
    2.28  }

     3.1 --- a/doc/tutorial.dox	Tue Oct 31 08:46:18 2006 +0000
     3.2 +++ b/doc/tutorial.dox	Tue Oct 31 09:32:44 2006 +0000
     3.3 @@ -23,8 +23,8 @@
     3.4    <LI>\ref algorithms
     3.5    <UL>
     3.6      <LI>\ref algo_bfs_dfs
     3.7 -    <LI>Dijkstra
     3.8 -    <LI>Kruskal
     3.9 +    <LI>\ref algo_dijkstra
    3.10 +    <LI>\ref algo_kruskal
    3.11    </UL>
    3.12    <LI>\ref maps2
    3.13    <UL>
    3.14 @@ -32,7 +32,7 @@
    3.15      <LI>Map Adaptors
    3.16      <LI>Special Purpose Maps
    3.17    </UL>
    3.18 -  <LI>Show a graph
    3.19 +  <LI>\ref show_a_graph
    3.20    <LI>Miscellaneous Tool
    3.21    <UL>
    3.22      <LI>LP solver