diff -r b1f441f24d08 -r bd4199049036 lemon/floyd_warshall.h
--- a/lemon/floyd_warshall.h	Wed Nov 02 16:32:29 2005 +0000
+++ b/lemon/floyd_warshall.h	Wed Nov 02 16:43:18 2005 +0000
@@ -150,7 +150,7 @@
   /// \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
+  /// The algorithm solves the shortest path problem for each pair
   /// of node when the edges can have negative length but the graph should
   /// 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