equal
deleted
inserted
replaced
347 In most cases the \ref Preflow "Preflow" algorithm provides the |
347 In most cases the \ref Preflow "Preflow" algorithm provides the |
348 fastest method for computing a maximum flow. All implementations |
348 fastest method for computing a maximum flow. All implementations |
349 also provide functions to query the minimum cut, which is the dual |
349 also provide functions to query the minimum cut, which is the dual |
350 problem of maximum flow. |
350 problem of maximum flow. |
351 |
351 |
352 \ref Circulation is a preflow push-relabel algorithm implemented directly |
352 \ref Circulation is a preflow push-relabel algorithm implemented directly |
353 for finding feasible circulations, which is a somewhat different problem, |
353 for finding feasible circulations, which is a somewhat different problem, |
354 but it is strongly related to maximum flow. |
354 but it is strongly related to maximum flow. |
355 For more information, see \ref Circulation. |
355 For more information, see \ref Circulation. |
356 */ |
356 */ |
357 |
357 |
468 - \ref MaxWeightedMatching Edmond's blossom shrinking algorithm for calculating |
468 - \ref MaxWeightedMatching Edmond's blossom shrinking algorithm for calculating |
469 maximum weighted matching in general graphs. |
469 maximum weighted matching in general graphs. |
470 - \ref MaxWeightedPerfectMatching |
470 - \ref MaxWeightedPerfectMatching |
471 Edmond's blossom shrinking algorithm for calculating maximum weighted |
471 Edmond's blossom shrinking algorithm for calculating maximum weighted |
472 perfect matching in general graphs. |
472 perfect matching in general graphs. |
|
473 - \ref MaxFractionalMatching Push-relabel algorithm for calculating |
|
474 maximum cardinality fractional matching in general graphs. |
|
475 - \ref MaxWeightedFractionalMatching Augmenting path algorithm for calculating |
|
476 maximum weighted fractional matching in general graphs. |
|
477 - \ref MaxWeightedPerfectFractionalMatching |
|
478 Augmenting path algorithm for calculating maximum weighted |
|
479 perfect fractional matching in general graphs. |
473 |
480 |
474 \image html bipartite_matching.png |
481 \image html bipartite_matching.png |
475 \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth |
482 \image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth |
476 */ |
483 */ |
477 |
484 |