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