Algorithms to compute rank-maximal matchings. More...
#include <LEP/mosp/config.h>#include <LEDA/array.h>#include <LEDA/graph.h>#include <LEDA/list.h>#include <LEDA/edge_array.h>#include <LEDA/std/assert.h>
Include dependency graph for RANK_MAX_MATCHING.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| mosp | |
| The main package namespace. | |
Functions | |
| leda::list< leda::edge > | mosp::BI_RANK_MAX_MATCHING (leda::graph &G, const leda::edge_array< int > &rank) |
| Compute a rank-maximal matching of a bipartite graph. More... | |
| leda::list< leda::edge > | mosp::BI_RANK_MAX_MATCHING_MWMR (leda::graph &G, const leda::edge_array< int > &rank) |
| Compute a rank-maximal matching of a bipartite graph. More... | |
| leda::list< leda::edge > | mosp::DBI_RANK_MAX_MATCHING_MWMR (leda::graph &G, const leda::edge_array< int > &rank) |
| Compute a rank-maximal matching of a bipartite graph. More... | |
| leda::array< int > | mosp::BI_RANK_MAX_MATCHING_PROFILE (const leda::graph &G, const leda::edge_array< int > &rank, const leda::list< leda::edge > &matching) |
| Compute the profile of a matching. More... | |
| leda::list< leda::edge > | mosp::BI_RANK_MAX_CAPACITATED_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::node_array< int > &capacity, const leda::edge_array< int > &rank) |
| Compute a rank-maximal matching of a bipartite graph with capacities on the right side of the bipartite graph. More... | |
Detailed Description
Algorithms to compute rank-maximal matchings.
