Uses of Class
com.jgalgo.alg.match.MatchingAlgoAbstractBasedMaximum
Package
Description
Algorithms for computing matchings in graphs, such as maximum/minimum weight matchings, maximum cardinality
matchings, perfect matchings, ect.
-
Uses of MatchingAlgoAbstractBasedMaximum in com.jgalgo.alg.match
Modifier and TypeClassDescriptionclass
Kuhn's Hungarian method for maximum weighted matching in bipartite graphs.class
Maximum weighted matching algorithm usingShortestPathSingleSource
for bipartite graphs.class
Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's dynamic LCA data structure.class
Edmonds' Blossom algorithm for Maximum weighted matching with Gabow's implementation WITHOUT dynamic LCA data structure.