doc/groups.dox
changeset 659 88753a77c634
parent 640 6c408d864fa1
child 660 d9cf3b5858ae
equal deleted inserted replaced
26:18297b9fca6a 27:e7c3b13872ff
   333 - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees.
   333 - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees.
   334 - \ref GoldbergTarjan Preflow push-relabel algorithm with dynamic trees.
   334 - \ref GoldbergTarjan Preflow push-relabel algorithm with dynamic trees.
   335 
   335 
   336 In most cases the \ref Preflow "Preflow" algorithm provides the
   336 In most cases the \ref Preflow "Preflow" algorithm provides the
   337 fastest method for computing a maximum flow. All implementations
   337 fastest method for computing a maximum flow. All implementations
   338 provides functions to also query the minimum cut, which is the dual
   338 also provide functions to query the minimum cut, which is the dual
   339 problem of the maximum flow.
   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.
   340 */
   345 */
   341 
   346 
   342 /**
   347 /**
   343 @defgroup min_cost_flow Minimum Cost Flow Algorithms
   348 @defgroup min_cost_flow Minimum Cost Flow Algorithms
   344 @ingroup algs
   349 @ingroup algs
   539 */
   544 */
   540 
   545 
   541 /**
   546 /**
   542 @defgroup spantree Minimum Spanning Tree Algorithms
   547 @defgroup spantree Minimum Spanning Tree Algorithms
   543 @ingroup algs
   548 @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.
   545 
   550 
   546 This group contains the algorithms for finding a minimum cost spanning
   551 This group contains the algorithms for finding minimum cost spanning
   547 tree in a graph.
   552 trees and arborescences.
   548 */
   553 */
   549 
   554 
   550 /**
   555 /**
   551 @defgroup auxalg Auxiliary Algorithms
   556 @defgroup auxalg Auxiliary Algorithms
   552 @ingroup algs
   557 @ingroup algs