summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc/groups.dox

changeset 1023 | e0cef67fe565 |

parent 999 | c279b19abc62 |

child 1164 | f63ba40a60f4 |

1.1 --- a/doc/groups.dox Sat Jan 08 15:52:07 2011 +0100 1.2 +++ b/doc/groups.dox Sun Jan 09 16:51:14 2011 +0100 1.3 @@ -406,10 +406,10 @@ 1.4 - \ref CycleCanceling Cycle-Canceling algorithms, two of which are 1.5 strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling. 1.6 1.7 -In general NetworkSimplex is the most efficient implementation, 1.8 -but in special cases other algorithms could be faster. 1.9 +In general, \ref NetworkSimplex and \ref CostScaling are the most efficient 1.10 +implementations, but the other two algorithms could be faster in special cases. 1.11 For example, if the total supply and/or capacities are rather small, 1.12 -CapacityScaling is usually the fastest algorithm (without effective scaling). 1.13 +\ref CapacityScaling is usually the fastest algorithm (without effective scaling). 1.14 */ 1.15 1.16 /** 1.17 @@ -471,7 +471,7 @@ 1.18 - \ref HowardMmc Howard's policy iteration algorithm 1.19 \ref dasdan98minmeancycle. 1.20 1.21 -In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the 1.22 +In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the 1.23 most efficient one, though the best known theoretical bound on its running 1.24 time is exponential. 1.25 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms 1.26 @@ -539,7 +539,7 @@ 1.27 */ 1.28 1.29 /** 1.30 -@defgroup planar Planarity Embedding and Drawing 1.31 +@defgroup planar Planar Embedding and Drawing 1.32 @ingroup algs 1.33 \brief Algorithms for planarity checking, embedding and drawing 1.34