mosp Namespace Reference

The main package namespace. More...

Classes
class	FSExponentialInstanceGenerator
	An fixed size "exponential" instance generator. More...
class	HighlyCorrelatedInstanceGenerator
	A highly correlated instance generator. More...
class	RegionalInstanceGenerator
	Regional instance generator. More...
class	StructuredInstanceGenerator
	An instance generator class. More...
class	VSExponentialInstanceGenerator
	An variable size "exponential" instance generator. More...

Functions
leda::list< leda::edge >	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 >	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 >	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 >	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 >	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...
bool	BI_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, leda::list< leda::edge > &L)
	Compute a popular matching. More...
bool	BI_APPROX_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, int maxphase, leda::list< leda::edge > &L, int &phase)
	Compute an approximate popular matching. More...
bool	BI_APPROX_POPULAR_MATCHING (const leda::graph &G, const leda::list< leda::node > &A, const leda::list< leda::node > &B, const leda::edge_array< int > &rank, leda::list< leda::edge > &L, int &phase)
	Compute an approximate popular matching. More...
bool	BI_UNPOPULARITY_FACTOR (graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const list< edge > &M, int &factor)
	Compute the unpopularity factor of a matching. More...
bool	BI_POPULAR_CAPACITATED_MATCHING (const graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const node_array< int > &capacity, list< edge > &L)
	Compute a popular matching in a capacitated instance. More...
int	BI_UNPOPULARITY_MARGIN (graph &G, const list< node > &A, const list< node > &B, const edge_array< int > &rank, const list< edge > &M)
	Compute the unpopularity margin of a matching. More...

Detailed Description

The main package namespace.