Changeset 755:134852d7fb0a in lemon1.2 for lemon
 Timestamp:
 10/10/09 08:18:46 (10 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/network_simplex.h
r730 r755 41 41 /// 42 42 /// \ref NetworkSimplex implements the primal Network Simplex algorithm 43 /// for finding a \ref min_cost_flow "minimum cost flow". 43 /// for finding a \ref min_cost_flow "minimum cost flow" 44 /// \ref amo93networkflows, \ref dantzig63linearprog, 45 /// \ref kellyoneill91netsimplex. 44 46 /// This algorithm is a specialized version of the linear programming 45 47 /// simplex method directly for the minimum cost flow problem. 
lemon/preflow.h
r715 r755 103 103 /// This class provides an implementation of GoldbergTarjan's \e preflow 104 104 /// \e pushrelabel algorithm producing a \ref max_flow 105 /// "flow of maximum value" in a digraph. 105 /// "flow of maximum value" in a digraph \ref clrs01algorithms, 106 /// \ref amo93networkflows, \ref goldberg88newapproach. 106 107 /// The preflow algorithms are the fastest known maximum 107 108 /// flow algorithms. The current implementation uses a mixture of the
Note: See TracChangeset
for help on using the changeset viewer.