maximum.bipartite.matching: Matching

In igraph/rigraph: Network Analysis and Visualization

Matching

Description

maximum.bipartite.matching() was renamed to max_bipartite_match() to create a more consistent API.

Usage

maximum.bipartite.matching(
  graph,
  types = NULL,
  weights = NULL,
  eps = .Machine$double.eps
)

Arguments

graph	The input graph. It might be directed, but edge directions will be ignored.
types	Vertex types, if the graph is bipartite. By default they are taken from the ‘type’ vertex attribute, if present.
weights	Potential edge weights. If the graph has an edge attribute called ‘weight’, and this argument is NULL, then the edge attribute is used automatically. In weighted matching, the weights of the edges must match as much as possible.
eps	A small real number used in equality tests in the weighted bipartite matching algorithm. Two real numbers are considered equal in the algorithm if their difference is smaller than eps. This is required to avoid the accumulation of numerical errors. By default it is set to the smallest x, such that 1+x \ne 1 holds. If you are running the algorithm with no weights, this argument is ignored.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.