diff -r 30c5179f296b -r eabbe162e32e src/work/athos/minlengthpaths.h
--- a/src/work/athos/minlengthpaths.h	Wed Apr 07 11:02:00 2004 +0000
+++ b/src/work/athos/minlengthpaths.h	Wed Apr 07 17:42:05 2004 +0000
@@ -64,10 +64,11 @@
     const Graph& G;
     const LengthMap& length;
 
-    //auxiliary variable
-    //The value is 1 iff the edge is reversed
+    //auxiliry variable
+    //The value is 1 iff the edge is reversed. 
+    //If the algorithm has finished, the edges of the seeked paths are 
+    //exactly those that are reversed 
     EdgeIntMap reversed; 
-
     
   public :
 
@@ -83,6 +84,7 @@
     int run(Node s, Node t, int k) {
       ConstMap const1map(1);
 
+      //We need a residual graph, in which some of the edges are reversed
       ResGraphType res_graph(G, reversed, const1map);
 
       //Initialize the copy of the Dijkstra potential to zero
@@ -94,8 +96,7 @@
       for (int i=0; i<k; ++i){
 	dijkstra.run(s);
 	if (!dijkstra.reached(t)){
-	  //There is no k path from s to t
-	  /// \TODO mit keresett itt ez a ++?
+	  //There are no k paths from s to t
 	  return i;
 	};