V- the graph vertex type
E- the graph edge type
public class MaximumWeightBipartiteMatching<V,E> extends Object implements WeightedMatchingAlgorithm<V,E>
|Constructor and Description|
Creates a new MaximumWeightBipartiteMatching algorithm instance.
|Modifier and Type||Method and Description|
Returns set of edges making up the matching
Returns weight of a matching found
public MaximumWeightBipartiteMatching(WeightedGraph<V,E> graph, Set<V> vertexPartition1, Set<V> vertexPartition2)
graph- simple undirected weighted bipartite graph to find matching in, with positive integer edge weights
vertexPartition1- first vertex partition of the bipartite graph, disjoint from vertexPartition2
vertexPartition2- second vertex partition of the bipartite graph, disjoint from vertexPartition1
Copyright © 2016. All rights reserved.