# Changeset 1023:e0cef67fe565 in lemon for doc/groups.dox

Ignore:
Timestamp:
01/09/11 16:51:14 (11 years ago)
Branch:
default
Phase:
public
Message:

Various doc improvements (#406)

File:
1 edited

Unmodified
Added
Removed
• ## doc/groups.dox

 r999 strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling. In general NetworkSimplex is the most efficient implementation, but in special cases other algorithms could be faster. In general, \ref NetworkSimplex and \ref CostScaling are the most efficient implementations, but the other two algorithms could be faster in special cases. For example, if the total supply and/or capacities are rather small, CapacityScaling is usually the fastest algorithm (without effective scaling). \ref CapacityScaling is usually the fastest algorithm (without effective scaling). */ \ref dasdan98minmeancycle. In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the most efficient one, though the best known theoretical bound on its running time is exponential. /** @defgroup planar Planarity Embedding and Drawing @defgroup planar Planar Embedding and Drawing @ingroup algs \brief Algorithms for planarity checking, embedding and drawing
Note: See TracChangeset for help on using the changeset viewer.