COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
01/30/12 23:24:40 (8 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Doc improvements for min cost flow algorithms (#437)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/network_simplex.h

    r1026 r1165  
    4949  ///
    5050  /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
    51   /// implementations available in LEMON for this problem.
     51  /// implementations available in LEMON for solving this problem.
     52  /// (For more information, see \ref min_cost_flow_algs "the module page".)
    5253  /// Furthermore, this class supports both directions of the supply/demand
    5354  /// inequality constraints. For more information, see \ref SupplyType.
     
    10071008    }
    10081009
    1009     /// \brief Return the flow map (the primal solution).
     1010    /// \brief Copy the flow values (the primal solution) into the
     1011    /// given map.
    10101012    ///
    10111013    /// This function copies the flow value on each arc into the given
     
    10311033    }
    10321034
    1033     /// \brief Return the potential map (the dual solution).
     1035    /// \brief Copy the potential values (the dual solution) into the
     1036    /// given map.
    10341037    ///
    10351038    /// This function copies the potential (dual value) of each node
Note: See TracChangeset for help on using the changeset viewer.