diff -r a48964a87141 -r a9b0863c2265 src/hugo/dijkstra.h
--- a/src/hugo/dijkstra.h	Thu Sep 02 11:20:49 2004 +0000
+++ b/src/hugo/dijkstra.h	Thu Sep 02 15:13:21 2004 +0000
@@ -87,7 +87,7 @@
     //The source node of the last execution.
     Node source;
 
-    ///Initialize maps
+    ///Initializes the maps.
     
     ///\todo Error if \c G or are \c NULL. What about \c length?
     ///\todo Better memory allocation (instead of new).
@@ -132,6 +132,8 @@
 
     ///Sets the graph the algorithm will run on.
     ///\return <tt> (*this) </tt>
+    ///\bug What about maps?
+    ///\todo It may be unnecessary
     Dijkstra &setGraph(const Graph &_G) 
     {
       G = &_G;
@@ -273,7 +275,7 @@
     ///Returns the 'previous edge' of the shortest path tree.
 
     ///For a node \c v it returns the 'previous edge' of the shortest path tree,
-    ///i.e. it returns the last edge from a shortest path from the root to \c
+    ///i.e. it returns the last edge of a shortest path from the root to \c
     ///v. It is \ref INVALID
     ///if \c v is unreachable from the root or if \c v=s. The
     ///shortest path tree used here is equal to the shortest path tree used in
@@ -322,11 +324,6 @@
     
   };
   
-
-  // **********************************************************************
-  //  IMPLEMENTATIONS
-  // **********************************************************************
-
 /// @}
   
 } //END OF NAMESPACE HUGO