[Lemon-commits] [lemon_svn] alpar: r2289 - hugo/trunk/lemon

[Lemon SVN]

Author: alpar
Date: Wed Nov  2 17:43:18 2005
New Revision: 2289

Modified:
   hugo/trunk/lemon/floyd_warshall.h
   hugo/trunk/lemon/johnson.h
   hugo/trunk/lemon/matrix_maps.h

Log:
Spellcheck

Modified: hugo/trunk/lemon/floyd_warshall.h
==============================================================================
--- hugo/trunk/lemon/floyd_warshall.h	(original)
+++ hugo/trunk/lemon/floyd_warshall.h	Wed Nov  2 17:43:18 2005
@@ -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

Modified: hugo/trunk/lemon/johnson.h
==============================================================================
--- hugo/trunk/lemon/johnson.h	(original)
+++ hugo/trunk/lemon/johnson.h	Wed Nov  2 17:43:18 2005
@@ -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

Modified: hugo/trunk/lemon/matrix_maps.h
==============================================================================
--- hugo/trunk/lemon/matrix_maps.h	(original)
+++ hugo/trunk/lemon/matrix_maps.h	Wed Nov  2 17:43:18 2005
@@ -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.