# HG changeset patch
# User alpar
# Date 1130949798 0
# Node ID bd419904903618a4f359cc81c30443eac3df68e8
# Parent  b1f441f24d08bc6891f02f51641e4ab3a473c560
Spellcheck

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
diff -r b1f441f24d08 -r bd4199049036 lemon/johnson.h
--- a/lemon/johnson.h	Wed Nov 02 16:32:29 2005 +0000
+++ b/lemon/johnson.h	Wed Nov 02 16:43:18 2005 +0000
@@ -183,7 +183,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
diff -r b1f441f24d08 -r bd4199049036 lemon/matrix_maps.h
--- a/lemon/matrix_maps.h	Wed Nov 02 16:32:29 2005 +0000
+++ b/lemon/matrix_maps.h	Wed Nov 02 16:43:18 2005 +0000
@@ -201,7 +201,7 @@
 
   /// \brief Container for store values for each ordered pair of graph items
   ///
-  /// This data structure can strore for each pairs of the same item
+  /// This data structure can strore for each pair of the same item
   /// type a value. It increase the size of the container when the 
   /// associated graph modified, so it updated automaticly whenever
   /// it is needed.
@@ -312,7 +312,7 @@
 
   /// \brief Container for store values for each unordered pair of graph items
   ///
-  /// This data structure can strore for each pairs of the same item
+  /// This data structure can strore for each pair of the same item
   /// type a value. It increase the size of the container when the 
   /// associated graph modified, so it updated automaticly whenever
   /// it is needed.