Ignore:
Timestamp:
05/07/09 02:07:59 (10 years ago)
Branch:
default
Phase:
public
Message:

Small doc improvements (#257)

Files:
3 edited

Unmodified
Removed
• doc/groups.dox

 r640 In most cases the \ref Preflow "Preflow" algorithm provides the fastest method for computing a maximum flow. All implementations provides functions to also query the minimum cut, which is the dual problem of the maximum flow. also provide functions to query the minimum cut, which is the dual problem of maximum flow. \ref Circulation is a preflow push-relabel algorithm implemented directly for finding feasible circulations, which is a somewhat different problem, but it is strongly related to maximum flow. For more information, see \ref Circulation. */ @defgroup spantree Minimum Spanning Tree Algorithms @ingroup algs \brief Algorithms for finding a minimum cost spanning tree in a graph. This group contains the algorithms for finding a minimum cost spanning tree in a graph. \brief Algorithms for finding minimum cost spanning trees and arborescences. This group contains the algorithms for finding minimum cost spanning trees and arborescences. */
• doc/mainpage.dox

 r559 \subsection howtoread How to read the documentation If you want to get a quick start and see the most important features then take a look at our \ref quicktour "Quick Tour to LEMON" which will guide you along. If you already feel like using our library, see the If you would like to get to know the library, see LEMON Tutorial. If you know what you are looking for then try to find it under the If you know what you are looking for, then try to find it under the Modules section.
• lemon/matching.h

 r594 /// This function runs the original Edmonds' algorithm. /// /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be /// called before using this function. void startSparse() { /// shrinks, therefore resulting in a faster algorithm for dense graphs. /// /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be /// called before using this function. void startDense() {
Note: See TracChangeset for help on using the changeset viewer.