[Lemon-commits] [lemon_svn] deba: r2293 - hugo/trunk/lemon

[Lemon SVN]

Author: deba
Date: Fri Nov  4 14:20:24 2005
New Revision: 2293

Modified:
   hugo/trunk/lemon/bfs.h
   hugo/trunk/lemon/dfs.h
   hugo/trunk/lemon/dijkstra.h
   hugo/trunk/lemon/euler.h

Log:
Hiding :) todos



Modified: hugo/trunk/lemon/bfs.h
==============================================================================
--- hugo/trunk/lemon/bfs.h	(original)
+++ hugo/trunk/lemon/bfs.h	Fri Nov  4 14:20:24 2005
@@ -122,7 +122,6 @@
   ///a Bfs traits class.
   ///
   ///\author Alpar Juttner
-  ///\todo A compare object would be nice.
 
 #ifdef DOXYGEN
   template <typename GR,

Modified: hugo/trunk/lemon/dfs.h
==============================================================================
--- hugo/trunk/lemon/dfs.h	(original)
+++ hugo/trunk/lemon/dfs.h	Fri Nov  4 14:20:24 2005
@@ -413,7 +413,7 @@
     ///one of the member functions called \c run(...).
     ///\n
     ///If you need more control on the execution,
-    ///first you must call \ref init(), then you can add several source nodes
+    ///first you must call \ref init(), then you can add a source node
     ///with \ref addSource().
     ///Finally \ref start() will perform the actual path
     ///computation.
@@ -1295,7 +1295,7 @@
     /// one of the member functions called \c run(...).
     /// \n
     /// If you need more control on the execution,
-    /// first you must call \ref init(), then you can add several source nodes
+    /// first you must call \ref init(), then you can adda source node
     /// with \ref addSource().
     /// Finally \ref start() will perform the actual path
     /// computation.

Modified: hugo/trunk/lemon/dijkstra.h
==============================================================================
--- hugo/trunk/lemon/dijkstra.h	(original)
+++ hugo/trunk/lemon/dijkstra.h	Fri Nov  4 14:20:24 2005
@@ -166,7 +166,6 @@
   ///class.
   ///
   ///\author Jacint Szabo and Alpar Juttner
-  ///\todo A compare object would be nice.
 
 #ifdef DOXYGEN
   template <typename GR,

Modified: hugo/trunk/lemon/euler.h
==============================================================================
--- hugo/trunk/lemon/euler.h	(original)
+++ hugo/trunk/lemon/euler.h	Fri Nov  4 14:20:24 2005
@@ -101,7 +101,6 @@
     ///Postfix incrementation
     
     ///\warning This gives back an Edge, not an EulerIt!
-    ///\todo Is this what we want?
     Edge operator++(int) 
     {
       Edge e=*this;
@@ -131,7 +130,7 @@
   }
   template<class Graph>
   typename disable_if<typename Graph::UndirTag,bool>::type
-  isEuler(const Graph &g) 
+  euler(const Graph &g) 
   {
     for(typename Graph::NodeIt n(g);n!=INVALID;++n)
       if(countInEdges(g,n)!=countOutEdges(g,n)) return false;