# 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
|
|
335 | 335 | |
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 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 | /** |
… |
… |
|
541 | 546 | /** |
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. |
| 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 |
547 | | tree in a graph. |
| 551 | This group contains the algorithms for finding minimum cost spanning |
| 552 | trees and arborescences. |
548 | 553 | */ |
549 | 554 | |
550 | 555 | /** |
diff --git a/doc/mainpage.dox b/doc/mainpage.dox
a
|
b
|
|
41 | 41 | |
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 the |
| 47 | 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 | |
54 | 50 | If you are a user of the old (0.x) series of LEMON, please check out the |
diff --git a/lemon/matching.h b/lemon/matching.h
a
|
b
|
|
499 | 499 | /// |
500 | 500 | /// This function runs the original Edmonds' algorithm. |
501 | 501 | /// |
502 | | /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be |
| 502 | /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be |
503 | 503 | /// called before using this function. |
504 | 504 | void startSparse() { |
505 | 505 | for(NodeIt n(_graph); n != INVALID; ++n) { |
… |
… |
|
518 | 518 | /// This function runs Edmonds' algorithm with a heuristic of postponing |
519 | 519 | /// shrinks, therefore resulting in a faster algorithm for dense graphs. |
520 | 520 | /// |
521 | | /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be |
| 521 | /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be |
522 | 522 | /// called before using this function. |
523 | 523 | void startDense() { |
524 | 524 | for(NodeIt n(_graph); n != INVALID; ++n) { |