COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
11/02/05 17:43:18 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2289
Message:

Spellcheck

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/floyd_warshall.h

    r1754 r1757  
    151151  /// kind of length.
    152152  ///
    153   /// The algorithm solves the shortest path problem for each pairs
     153  /// The algorithm solves the shortest path problem for each pair
    154154  /// of node when the edges can have negative length but the graph should
    155155  /// not contain cycles with negative sum of length. If we can assume
Note: See TracChangeset for help on using the changeset viewer.