1.1 --- a/lemon/floyd_warshall.h	Wed Nov 02 16:32:29 2005 +0000
     1.2 +++ b/lemon/floyd_warshall.h	Wed Nov 02 16:43:18 2005 +0000
     1.3 @@ -150,7 +150,7 @@
     1.4    /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
     1.5    /// kind of length.
     1.6    ///
     1.7 -  /// The algorithm solves the shortest path problem for each pairs
     1.8 +  /// The algorithm solves the shortest path problem for each pair
     1.9    /// of node when the edges can have negative length but the graph should
    1.10    /// not contain cycles with negative sum of length. If we can assume
    1.11    /// that all edge is non-negative in the graph then the dijkstra algorithm