Changeset 1166:d59484d5fc1f in lemon for lemon/capacity_scaling.h
 Timestamp:
 11/07/12 17:39:39 (7 years ago)
 Branch:
 default
 Parents:
 1163:e344f0887c59 (diff), 1165:16f55008c863 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r1137 r1166 70 70 /// \ref edmondskarp72theoretical. It is an efficient dual 71 71 /// solution method. 72 /// 73 /// This algorithm is typically slower than \ref CostScaling and 74 /// \ref NetworkSimplex, but in special cases, it can be more 75 /// efficient than them. 76 /// (For more information, see \ref min_cost_flow_algs "the module page".) 72 77 /// 73 78 /// Most of the parameters of the problem (except for the digraph) … … 677 682 } 678 683 679 /// \brief Return the flow map (the primal solution). 684 /// \brief Copy the flow values (the primal solution) into the 685 /// given map. 680 686 /// 681 687 /// This function copies the flow value on each arc into the given … … 701 707 } 702 708 703 /// \brief Return the potential map (the dual solution). 709 /// \brief Copy the potential values (the dual solution) into the 710 /// given map. 704 711 /// 705 712 /// This function copies the potential (dual value) of each node 
lemon/capacity_scaling.h
r1165 r1166 93 93 /// 94 94 /// \warning Both \c V and \c C must be signed number types. 95 /// \warning All input data (capacities, supply values, and costs) must96 /// be integer.95 /// \warning Capacity bounds and supply values must be integer, but 96 /// arc costs can be arbitrary real numbers. 97 97 /// \warning This algorithm does not support negative costs for 98 98 /// arcs having infinite upper bound.
Note: See TracChangeset
for help on using the changeset viewer.