COIN-OR::LEMON - Graph Library

Changeset 2474:e6368948d5f7 in lemon-0.x for lemon/min_cost_flow.h


Ignore:
Timestamp:
09/20/07 01:35:27 (12 years ago)
Author:
Peter Kovacs
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3313
Message:

Small bug fixes and changes in the documentation.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_flow.h

    r2440 r2474  
    4040  /// \ref lemon::NetworkSimplex "NetworkSimplex", wich is the most
    4141  /// efficient implementation for the minimum cost flow problem in the
    42   /// Lemon library according to our benchmark tests.
     42  /// LEMON library according to our benchmark tests.
    4343  ///
    4444  /// \note There are three implementations for the minimum cost flow
Note: See TracChangeset for help on using the changeset viewer.