#include <lemon/graph_utils.h>
#include <lemon/iterable_maps.h>
#include <iostream>
#include <queue>
#include <lemon/elevator.h>
Namespaces | |
namespace | lemon |
Classes | |
class | PrBipartiteMatching |
Max cardinality matching algorithm based on push-relabel principle. More... | |
Functions | |
template<class Graph> | |
int | prBipartiteMatching (const Graph &g) |
Maximum cardinality of the matchings in a bipartite graph. | |
template<class Graph, class MT> | |
int | prBipartiteMatching (const Graph &g, MT &matching) |
Maximum cardinality matching in a bipartite graph. | |
template<class Graph, class MT, class GT> | |
int | prBipartiteMatching (const Graph &g, MT &matching, GT &barrier) |
Maximum cardinality matching in a bipartite graph. | |
template<class Graph> | |
bool | prPerfectBipartiteMatching (const Graph &g) |
Perfect matching in a bipartite graph. | |
template<class Graph, class MT> | |
bool | prPerfectBipartiteMatching (const Graph &g, MT &matching) |
Perfect matching in a bipartite graph. | |
template<class Graph, class MT, class GT> | |
bool | prPerfectBipartiteMatching (const Graph &g, MT &matching, GT &barrier) |
Perfect matching in a bipartite graph. |