Package org.graph4j.matching

package org.graph4j.matching

Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.

Related Packages

Package	Description
org.graph4j	The main interfaces and classes for representing and using graphs.

Class	Description
EdmondsMaximumMatching	TODO Goldberg, p.95
GreedyWeightedMatching	Greedy algorithm to create a weighted matching.
HopcroftKarpMaximumMatching	Computes the maximum cardinality matching in a bipartite graph.
MatchingAlgorithm	The contract for matching algorithms.
MaximalCardinalityMatching	Creates a maximal cardinality matching either randomly or using a simple heuristic.