Changeset 1003:16f55008c863 in lemon-main for lemon/cost_scaling.h
- Timestamp:
- 01/30/12 23:24:40 (12 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/cost_scaling.h
r938 r1003 99 99 /// 100 100 /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest 101 /// implementations available in LEMON for this problem. 101 /// implementations available in LEMON for solving this problem. 102 /// (For more information, see \ref min_cost_flow_algs "the module page".) 102 103 /// 103 104 /// Most of the parameters of the problem (except for the digraph) … … 705 706 } 706 707 707 /// \brief Return the flow map (the primal solution). 708 /// \brief Copy the flow values (the primal solution) into the 709 /// given map. 708 710 /// 709 711 /// This function copies the flow value on each arc into the given … … 729 731 } 730 732 731 /// \brief Return the potential map (the dual solution). 733 /// \brief Copy the potential values (the dual solution) into the 734 /// given map. 732 735 /// 733 736 /// This function copies the potential (dual value) of each node
Note: See TracChangeset
for help on using the changeset viewer.