COIN-OR::LEMON - Graph Library

Changeset 968:1a7593db0eaa in lemon-0.x


Ignore:
Timestamp:
11/08/04 16:23:31 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1355
Message:

Several changes in doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/suurballe.h

    r946 r968  
    4545  ///\param LengthMap The type of the length map (values should be nonnegative).
    4646  ///
    47   ///\note It it questionable if it is correct to call this method after
     47  ///\note It it questionable whether it is correct to call this method after
    4848  ///%Suurballe for it is just a special case of Edmond's and Karp's algorithm
    49   ///for finding minimum cost flows. In fact, this implementation is just
     49  ///for finding minimum cost flows. In fact, this implementation just
    5050  ///wraps the MinCostFlow algorithms. The paper of both %Suurballe and
    5151  ///Edmonds-Karp published in 1972, therefore it is possibly right to
Note: See TracChangeset for help on using the changeset viewer.