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