Finds a minimum cost matching in a bipartite graph using the network simplex method. More...

Public Member Functions
	MinimumCostMatching (IGraph graph, Func< Node, bool > isRed, Func< Arc, double > cost, int minimumMatchingSize=0, int maximumMatchingSize=int.MaxValue)

Properties
Func< Arc, double >	Cost `[get, set]`
	A finite cost function on the arcs of Graph. More...

IGraph	Graph `[get, set]`
	The input graph. More...

Func< Node, bool >	IsRed `[get, set]`
	Describes a bipartition of Graph by dividing its nodes into red and blue ones. More...

IMatching	Matching `[get, set]`
	The minimum cost matching, computed using the network simplex method. More...

int	MaximumMatchingSize `[get, set]`
	Maximum constraint on the size (number of arcs) of the returned matching. More...

int	MinimumMatchingSize `[get, set]`
	Minimum constraint on the size (number of arcs) of the returned matching. More...

Detailed Description

Finds a minimum cost matching in a bipartite graph using the network simplex method.

Definition at line 33 of file MinimumCostMatching.cs.

Constructor & Destructor Documentation

Satsuma.MinimumCostMatching.MinimumCostMatching	(	IGraph	graph,
		Func< Node, bool >	isRed,
		Func< Arc, double >	cost,
		int	minimumMatchingSize = `0`,
		int	maximumMatchingSize = `int.MaxValue`
	)

Definition at line 49 of file MinimumCostMatching.cs.

Func<Arc, double> Satsuma.MinimumCostMatching.Cost

getset

A finite cost function on the arcs of Graph.

Definition at line 40 of file MinimumCostMatching.cs.

IGraph Satsuma.MinimumCostMatching.Graph

getset

The input graph.

Definition at line 36 of file MinimumCostMatching.cs.

Func<Node, bool> Satsuma.MinimumCostMatching.IsRed

getset

Describes a bipartition of Graph by dividing its nodes into red and blue ones.

Definition at line 38 of file MinimumCostMatching.cs.

IMatching Satsuma.MinimumCostMatching.Matching

getset

The minimum cost matching, computed using the network simplex method.

Null if a matching of the specified size could not be found.

Definition at line 47 of file MinimumCostMatching.cs.

int Satsuma.MinimumCostMatching.MaximumMatchingSize

getset

Maximum constraint on the size (number of arcs) of the returned matching.

Definition at line 44 of file MinimumCostMatching.cs.

int Satsuma.MinimumCostMatching.MinimumMatchingSize

getset

Minimum constraint on the size (number of arcs) of the returned matching.

Definition at line 42 of file MinimumCostMatching.cs.

The documentation for this class was generated from the following file: