Changeset 1757:bd4199049036 in lemon-0.x for lemon/floyd_warshall.h

Timestamp:

11/02/05 17:43:18 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2289

Message:

Spellcheck

File:

• lemon/floyd_warshall.h (modified) (1 diff)

lemon/floyd_warshall.h

@@ -151 +151 @@
   /// 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