diff -r d6f12a9b5cbf -r 46818ce27a60 doc/algorithms.dox
--- a/doc/algorithms.dox	Fri Aug 31 08:40:49 2007 +0000
+++ b/doc/algorithms.dox	Thu Sep 13 22:05:32 2007 +0000
@@ -95,7 +95,7 @@
 And finally you can start the process with \ref lemon::Bfs::start "start()", or
 you can write your own loop to process the nodes one-by-one.
 
-\todo demo for bfs advanced control
+\todo Demo for Bfs advanced control.
 
 \subsection Dfs
 Since Dfs is very similar to Bfs with a few tiny differences we only see a bit more complex example
@@ -149,6 +149,8 @@
 
 The program is to be found in the \ref demo directory: \ref topological_ordering.cc
 
+\todo Check the linking of the demo file, the code samples are missing.
+
 More algorithms are described in the \ref algorithms2 "second part".
 */
 }