Changes in / [696:76cbcb3e9bbb:699:e2f99a473998] in lemon
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r687 r698 336 336 In most cases the \ref Preflow "Preflow" algorithm provides the 337 337 fastest 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. 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 pushrelabel 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 … … 542 547 @defgroup spantree Minimum Spanning Tree Algorithms 543 548 @ingroup algs 544 \brief Algorithms for finding a minimum cost spanning tree in a graph.545 546 This group contains the algorithms for finding aminimum cost spanning547 tree in a graph.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. 548 553 */ 549 554 
doc/mainpage.dox
r606 r698 42 42 \subsection howtoread How to read the documentation 43 43 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 44 If you would like to get to know the library, see 49 45 <a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>. 50 46 51 If you know what you are looking for then try to find it under the47 If you know what you are looking for, then try to find it under the 52 48 <a class="el" href="modules.html">Modules</a> section. 53 49 
lemon/matching.h
r641 r698 500 500 /// This function runs the original Edmonds' algorithm. 501 501 /// 502 /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be502 /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be 503 503 /// called before using this function. 504 504 void startSparse() { … … 519 519 /// shrinks, therefore resulting in a faster algorithm for dense graphs. 520 520 /// 521 /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be521 /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be 522 522 /// called before using this function. 523 523 void startDense() {
Note: See TracChangeset
for help on using the changeset viewer.