V
- the graph vertex typeE
- the graph edge typeHopcroftKarpBipartiteMatching
instead.@Deprecated public class HopcroftKarpBipartiteMatching<V,E> extends Object implements MatchingAlgorithm<V,E>
MatchingAlgorithm.Matching<E>, MatchingAlgorithm.MatchingImpl<E>
DEFAULT_EPSILON
Constructor and Description |
---|
HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph,
Set<V> partition1,
Set<V> partition2)
Deprecated.
Create a new instance of the Hopcroft-Karp algorithm for the computation of maximum matchings
in bipartite graphs.
|
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
|
public HopcroftKarpBipartiteMatching(UndirectedGraph<V,E> graph, Set<V> partition1, Set<V> partition2)
graph
- the input graphpartition1
- vertex set of one of the partitions of the bipartite graphpartition2
- vertex set of the other partition of the bipartite graphpublic Set<E> getMatching()
MatchingAlgorithm
getMatching
in interface MatchingAlgorithm<V,E>
public MatchingAlgorithm.Matching<E> computeMatching()
computeMatching
in interface MatchingAlgorithm<V,E>
Copyright © 2017. All rights reserved.