V
- the graph vertex typeE
- the graph edge typeMaximumWeightBipartiteMatching
instead.@Deprecated public class MaximumWeightBipartiteMatching<V,E> extends Object implements WeightedMatchingAlgorithm<V,E>
MatchingAlgorithm.Matching<E>, MatchingAlgorithm.MatchingImpl<E>
DEFAULT_EPSILON
Constructor and Description |
---|
MaximumWeightBipartiteMatching(WeightedGraph<V,E> graph,
Set<V> vertexPartition1,
Set<V> vertexPartition2)
Deprecated.
Creates a new MaximumWeightBipartiteMatching algorithm instance.
|
Modifier and Type | Method and Description |
---|---|
MatchingAlgorithm.Matching<E> |
computeMatching()
Deprecated.
Compute a matching for a given graph.
|
Set<E> |
getMatching()
Deprecated.
Returns set of edges making up the matching
|
double |
getMatchingWeight()
Deprecated.
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 weightsvertexPartition1
- first vertex partition of the bipartite graph, disjoint from
vertexPartition2vertexPartition2
- second vertex partition of the bipartite graph, disjoint from
vertexPartition1public Set<E> getMatching()
MatchingAlgorithm
getMatching
in interface MatchingAlgorithm<V,E>
public double getMatchingWeight()
WeightedMatchingAlgorithm
getMatchingWeight
in interface WeightedMatchingAlgorithm<V,E>
public MatchingAlgorithm.Matching<E> computeMatching()
computeMatching
in interface MatchingAlgorithm<V,E>
Copyright © 2017. All rights reserved.