1.1 --- a/doc/algorithms.dox	Tue Oct 31 08:46:18 2006 +0000
     1.2 +++ b/doc/algorithms.dox	Tue Oct 31 09:32:44 2006 +0000
     1.3 @@ -94,11 +94,15 @@
     1.4  \dontinclude topological_ordering.cc
     1.5  First of all we will need an own \ref lemon::Dfs::ProcessedMap "ProcessedMap". The ordering
     1.6  will be done through it.
     1.7 -\skip SerializingWriteMap
     1.8 +\skip MyOrdererMap
     1.9  \until };
    1.10  The class meets the \ref lemon::WriteMap "WriteMap" concept. In it's \c set() method the only thing
    1.11  we need to do is insert the key - that is the node who's processing just finished - into the beginning
    1.12 -of the list.
    1.13 +of the list.<br>
    1.14 +Although we implemented this needed helper class ourselves it was not necessary.
    1.15 +The \ref lemon::FrontInserterBoolMap "FrontInserterBoolMap" class does exactly
    1.16 +what we needed. To be correct it's more general - and it's all in \c LEMON. But
    1.17 +we wanted to show you, how easy is to add additional functionality.
    1.18  
    1.19  First we declare the needed data structures: the graph and a map to store the nodes' label.
    1.20  \skip ListGraph
    1.21 @@ -126,5 +130,7 @@
    1.22  \until endl
    1.23  
    1.24  The program is to be found in the \ref demo directory: \ref topological_ordering.cc
    1.25 +
    1.26 +More algorithms are described in the \ref algorithms2 "second part".
    1.27  */
    1.28  }