Changeset 2113:48ec8161f9e1 in lemon0.x
 Timestamp:
 06/28/06 17:38:45 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2819
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/edmonds_karp.h
r2059 r2113 44 44 /// The time complexity of the algorithm is \f$ O(n * e^2) \f$ in 45 45 /// worst case. Always try the preflow algorithm instead of this if 46 /// you does not have some additional reason than to compute the 47 /// optimal flow which has \f$ O(n^3) \f$ time complexity. 46 /// you just want to compute the optimal flow. 48 47 /// 49 48 /// \param _Graph The directed graph type the algorithm runs on.
Note: See TracChangeset
for help on using the changeset viewer.