equal
deleted
inserted
replaced
433 /** |
433 /** |
434 @defgroup matching Matching Algorithms |
434 @defgroup matching Matching Algorithms |
435 @ingroup algs |
435 @ingroup algs |
436 \brief Algorithms for finding matchings in graphs and bipartite graphs. |
436 \brief Algorithms for finding matchings in graphs and bipartite graphs. |
437 |
437 |
438 This group contains algorithm objects and functions to calculate |
438 This group contains the algorithms for calculating |
439 matchings in graphs and bipartite graphs. The general matching problem is |
439 matchings in graphs and bipartite graphs. The general matching problem is |
440 finding a subset of the arcs which does not shares common endpoints. |
440 finding a subset of the edges for which each node has at most one incident |
|
441 edge. |
441 |
442 |
442 There are several different algorithms for calculate matchings in |
443 There are several different algorithms for calculate matchings in |
443 graphs. The matching problems in bipartite graphs are generally |
444 graphs. The matching problems in bipartite graphs are generally |
444 easier than in general graphs. The goal of the matching optimization |
445 easier than in general graphs. The goal of the matching optimization |
445 can be finding maximum cardinality, maximum weight or minimum cost |
446 can be finding maximum cardinality, maximum weight or minimum cost |