COIN-OR::LEMON - Graph Library

Ticket #257: 257-main-3adf5e2d1e62.patch

File 257-main-3adf5e2d1e62.patch, 3.0 KB (added by Peter Kovacs, 10 years ago)
  • doc/groups.dox

    # HG changeset patch
    # User Peter Kovacs <kpeter@inf.elte.hu>
    # Date 1241654879 -7200
    # Node ID 3adf5e2d1e62e87e255185722497c068d6fa93c0
    # Parent  e01957e96c6796a11d9f3bbf751eea8ae274221c
    Small doc improvements (#257)
    
    diff --git a/doc/groups.dox b/doc/groups.dox
    a b  
    335335
    336336In most cases the \ref Preflow "Preflow" algorithm provides the
    337337fastest method for computing a maximum flow. All implementations
    338 provides functions to also query the minimum cut, which is the dual
    339 problem of the maximum flow.
     338also provide functions to query the minimum cut, which is the dual
     339problem of maximum flow.
     340
     341\ref Circulation is a preflow push-relabel algorithm implemented directly
     342for finding feasible circulations, which is a somewhat different problem,
     343but it is strongly related to maximum flow.
     344For more information, see \ref Circulation.
    340345*/
    341346
    342347/**
     
    541546/**
    542547@defgroup spantree Minimum Spanning Tree Algorithms
    543548@ingroup algs
    544 \brief Algorithms for finding a minimum cost spanning tree in a graph.
     549\brief Algorithms for finding minimum cost spanning trees and arborescences.
    545550
    546 This group contains the algorithms for finding a minimum cost spanning
    547 tree in a graph.
     551This group contains the algorithms for finding minimum cost spanning
     552trees and arborescences.
    548553*/
    549554
    550555/**
  • doc/mainpage.dox

    diff --git a/doc/mainpage.dox b/doc/mainpage.dox
    a b  
    4141
    4242\subsection howtoread How to read the documentation
    4343
    44 If you want to get a quick start and see the most important features then
    45 take a look at our \ref quicktour
    46 "Quick Tour to LEMON" which will guide you along.
    47 
    48 If you already feel like using our library, see the
     44If you would like to get to know the library, see
    4945<a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>.
    5046
    51 If you know what you are looking for then try to find it under the
     47If you know what you are looking for, then try to find it under the
    5248<a class="el" href="modules.html">Modules</a> section.
    5349
    5450If you are a user of the old (0.x) series of LEMON, please check out the
  • lemon/matching.h

    diff --git a/lemon/matching.h b/lemon/matching.h
    a b  
    499499    ///
    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() {
    505505      for(NodeIt n(_graph); n != INVALID; ++n) {
     
    518518    /// This function runs Edmonds' algorithm with a heuristic of postponing
    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() {
    524524      for(NodeIt n(_graph); n != INVALID; ++n) {