# Changeset 2113:48ec8161f9e1 in lemon-0.x

Ignore:
Timestamp:
06/28/06 17:38:45 (15 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2819
Message:

Some modification in the documentation.

File:
1 edited

Unmodified
Added
Removed
• ## lemon/edmonds_karp.h

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