COIN-OR::LEMON - Graph Library

Changeset 651:3adf5e2d1e62 in lemon-1.2 for doc/groups.dox


Ignore:
Timestamp:
05/07/09 02:07:59 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small doc improvements (#257)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r640 r651  
    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
     
    542547@defgroup spantree Minimum Spanning Tree Algorithms
    543548@ingroup algs
    544 \brief Algorithms for finding a minimum cost spanning tree in a graph.
    545 
    546 This group contains the algorithms for finding a minimum cost spanning
    547 tree in a graph.
     549\brief Algorithms for finding minimum cost spanning trees and arborescences.
     550
     551This group contains the algorithms for finding minimum cost spanning
     552trees and arborescences.
    548553*/
    549554
Note: See TracChangeset for help on using the changeset viewer.