COIN-OR::LEMON - Graph Library

Ignore:
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r698 r687  
    336336In most cases the \ref Preflow "Preflow" algorithm provides the
    337337fastest method for computing a maximum flow. All implementations
    338 also provide functions to query the minimum cut, which is the dual
    339 problem of maximum flow.
    340 
    341 \ref Circulation is a preflow push-relabel algorithm implemented directly
    342 for finding feasible circulations, which is a somewhat different problem,
    343 but it is strongly related to maximum flow.
    344 For more information, see \ref Circulation.
     338provides functions to also query the minimum cut, which is the dual
     339problem of the maximum flow.
    345340*/
    346341
     
    547542@defgroup spantree Minimum Spanning Tree Algorithms
    548543@ingroup algs
    549 \brief Algorithms for finding minimum cost spanning trees and arborescences.
    550 
    551 This group contains the algorithms for finding minimum cost spanning
    552 trees and arborescences.
     544\brief Algorithms for finding a minimum cost spanning tree in a graph.
     545
     546This group contains the algorithms for finding a minimum cost spanning
     547tree in a graph.
    553548*/
    554549
  • doc/mainpage.dox

    r698 r606  
    4242\subsection howtoread How to read the documentation
    4343
    44 If you would like to get to know the library, see
     44If you want to get a quick start and see the most important features then
     45take a look at our \ref quicktour
     46"Quick Tour to LEMON" which will guide you along.
     47
     48If you already feel like using our library, see the
    4549<a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>.
    4650
    47 If you know what you are looking for, then try to find it under the
     51If you know what you are looking for then try to find it under the
    4852<a class="el" href="modules.html">Modules</a> section.
    4953
  • lemon/matching.h

    r698 r641  
    500500    /// This function runs the original Edmonds' algorithm.
    501501    ///
    502     /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
     502    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
    503503    /// called before using this function.
    504504    void startSparse() {
     
    519519    /// shrinks, therefore resulting in a faster algorithm for dense graphs.
    520520    ///
    521     /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
     521    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
    522522    /// called before using this function.
    523523    void startDense() {
Note: See TracChangeset for help on using the changeset viewer.