1.1 --- a/lemon/bfs.h	Fri Nov 04 12:01:40 2005 +0000
     1.2 +++ b/lemon/bfs.h	Fri Nov 04 13:20:24 2005 +0000
     1.3 @@ -122,7 +122,6 @@
     1.4    ///a Bfs traits class.
     1.5    ///
     1.6    ///\author Alpar Juttner
     1.7 -  ///\todo A compare object would be nice.
     1.8  
     1.9  #ifdef DOXYGEN
    1.10    template <typename GR,

     2.1 --- a/lemon/dfs.h	Fri Nov 04 12:01:40 2005 +0000
     2.2 +++ b/lemon/dfs.h	Fri Nov 04 13:20:24 2005 +0000
     2.3 @@ -413,7 +413,7 @@
     2.4      ///one of the member functions called \c run(...).
     2.5      ///\n
     2.6      ///If you need more control on the execution,
     2.7 -    ///first you must call \ref init(), then you can add several source nodes
     2.8 +    ///first you must call \ref init(), then you can add a source node
     2.9      ///with \ref addSource().
    2.10      ///Finally \ref start() will perform the actual path
    2.11      ///computation.
    2.12 @@ -1295,7 +1295,7 @@
    2.13      /// one of the member functions called \c run(...).
    2.14      /// \n
    2.15      /// If you need more control on the execution,
    2.16 -    /// first you must call \ref init(), then you can add several source nodes
    2.17 +    /// first you must call \ref init(), then you can adda source node
    2.18      /// with \ref addSource().
    2.19      /// Finally \ref start() will perform the actual path
    2.20      /// computation.

     3.1 --- a/lemon/dijkstra.h	Fri Nov 04 12:01:40 2005 +0000
     3.2 +++ b/lemon/dijkstra.h	Fri Nov 04 13:20:24 2005 +0000
     3.3 @@ -166,7 +166,6 @@
     3.4    ///class.
     3.5    ///
     3.6    ///\author Jacint Szabo and Alpar Juttner
     3.7 -  ///\todo A compare object would be nice.
     3.8  
     3.9  #ifdef DOXYGEN
    3.10    template <typename GR,

     4.1 --- a/lemon/euler.h	Fri Nov 04 12:01:40 2005 +0000
     4.2 +++ b/lemon/euler.h	Fri Nov 04 13:20:24 2005 +0000
     4.3 @@ -101,7 +101,6 @@
     4.4      ///Postfix incrementation
     4.5      
     4.6      ///\warning This gives back an Edge, not an EulerIt!
     4.7 -    ///\todo Is this what we want?
     4.8      Edge operator++(int) 
     4.9      {
    4.10        Edge e=*this;
    4.11 @@ -131,7 +130,7 @@
    4.12    }
    4.13    template<class Graph>
    4.14    typename disable_if<typename Graph::UndirTag,bool>::type
    4.15 -  isEuler(const Graph &g) 
    4.16 +  euler(const Graph &g) 
    4.17    {
    4.18      for(typename Graph::NodeIt n(g);n!=INVALID;++n)
    4.19        if(countInEdges(g,n)!=countOutEdges(g,n)) return false;