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

     2.1 --- a/lemon/johnson.h	Wed Nov 02 16:32:29 2005 +0000
     2.2 +++ b/lemon/johnson.h	Wed Nov 02 16:43:18 2005 +0000
     2.3 @@ -183,7 +183,7 @@
     2.4    /// \ref concept::ReadMap "ReadMap", so it is easy to change it to any 
     2.5    /// kind of length.
     2.6    ///
     2.7 -  /// The algorithm solves the shortest path problem for each pairs
     2.8 +  /// The algorithm solves the shortest path problem for each pair
     2.9    /// of node when the edges can have negative length but the graph should
    2.10    /// not contain cycles with negative sum of length. If we can assume
    2.11    /// that all edge is non-negative in the graph then the dijkstra algorithm

     3.1 --- a/lemon/matrix_maps.h	Wed Nov 02 16:32:29 2005 +0000
     3.2 +++ b/lemon/matrix_maps.h	Wed Nov 02 16:43:18 2005 +0000
     3.3 @@ -201,7 +201,7 @@
     3.4  
     3.5    /// \brief Container for store values for each ordered pair of graph items
     3.6    ///
     3.7 -  /// This data structure can strore for each pairs of the same item
     3.8 +  /// This data structure can strore for each pair of the same item
     3.9    /// type a value. It increase the size of the container when the 
    3.10    /// associated graph modified, so it updated automaticly whenever
    3.11    /// it is needed.
    3.12 @@ -312,7 +312,7 @@
    3.13  
    3.14    /// \brief Container for store values for each unordered pair of graph items
    3.15    ///
    3.16 -  /// This data structure can strore for each pairs of the same item
    3.17 +  /// This data structure can strore for each pair of the same item
    3.18    /// type a value. It increase the size of the container when the 
    3.19    /// associated graph modified, so it updated automaticly whenever
    3.20    /// it is needed.