diff -r 98d83dd56c1d -r 4bf5ceb49023 lemon/floyd_warshall.h
--- a/lemon/floyd_warshall.h	Wed Nov 02 15:26:04 2005 +0000
+++ b/lemon/floyd_warshall.h	Wed Nov 02 15:27:38 2005 +0000
@@ -142,20 +142,20 @@
 
   };
   
-  /// \brief FloydWarshall algorithm class.
+  /// \brief %FloydWarshall algorithm class.
   ///
   /// \ingroup flowalgs
-  /// This class provides an efficient implementation of \c FloydWarshall 
+  /// This class provides an efficient implementation of \c Floyd-Warshall 
   /// algorithm. The edge lengths are passed to the algorithm using a
   /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
   /// kind of length.
   ///
   /// The algorithm solves the shortest path problem for each pairs
   /// of node when the edges can have negative length but the graph should
-  /// not contain circle with negative sum of length. If we can assume
+  /// not contain cycles with negative sum of length. If we can assume
   /// that all edge is non-negative in the graph then the dijkstra algorithm
   /// should be used from each node rather and if the graph is sparse and
-  /// there are negative circles then the johson algorithm.
+  /// there are negative circles then the johnson algorithm.
   ///
   /// The complexity of this algorithm is O(n^3 + e).
   ///
@@ -428,10 +428,10 @@
       }
     }
 
-    /// \brief Executes the algorithm and checks the negative circles.
+    /// \brief Executes the algorithm and checks the negative cycles.
     ///
     /// This method runs the %FloydWarshall algorithm in order to compute 
-    /// the shortest path to each node pairs. If there is a negative circle 
+    /// the shortest path to each node pairs. If there is a negative cycle 
     /// in the graph it gives back false. 
     /// The algorithm computes 
     /// - The shortest path tree for each node.