r873:23da1b807280
Tue, 16 Mar 2010 21:18:39
[Not Reviewed]
0 comments (0 inline)
0
1
0
| ... | ... |
@@ -515,25 +515,25 @@ |
| 515 | 515 |
- \ref MinCostMaxBipartiteMatching |
| 516 | 516 |
Successive shortest path algorithm for calculating minimum cost maximum |
| 517 | 517 |
matching in bipartite graphs. |
| 518 | 518 |
- \ref MaxMatching Edmond's blossom shrinking algorithm for calculating |
| 519 | 519 |
maximum cardinality matching in general graphs. |
| 520 | 520 |
- \ref MaxWeightedMatching Edmond's blossom shrinking algorithm for calculating |
| 521 | 521 |
maximum weighted matching in general graphs. |
| 522 | 522 |
- \ref MaxWeightedPerfectMatching |
| 523 | 523 |
Edmond's blossom shrinking algorithm for calculating maximum weighted |
| 524 | 524 |
perfect matching in general graphs. |
| 525 | 525 |
|
| 526 | 526 |
\image html matching.png |
| 527 |
\image latex matching.eps " |
|
| 527 |
\image latex matching.eps "Min Cost Perfect Matching" width=\textwidth |
|
| 528 | 528 |
*/ |
| 529 | 529 |
|
| 530 | 530 |
/** |
| 531 | 531 |
@defgroup graph_properties Connectivity and Other Graph Properties |
| 532 | 532 |
@ingroup algs |
| 533 | 533 |
\brief Algorithms for discovering the graph properties |
| 534 | 534 |
|
| 535 | 535 |
This group contains the algorithms for discovering the graph properties |
| 536 | 536 |
like connectivity, bipartiteness, euler property, simplicity etc. |
| 537 | 537 |
|
| 538 | 538 |
\image html connected_components.png |
| 539 | 539 |
\image latex connected_components.eps "Connected components" width=\textwidth |
0 comments (0 inline)