V- the graph vertex type
E- the graph edge type
public class GreedyMaximumCardinalityMatching<V,E> extends Object implements MatchingAlgorithm<V,E>
Independent of the mode, the resulting matching is maximal, and is therefore guaranteed to contain at least half of the edges that a maximum matching has (1/2 approximation). Runtime complexity: O(m) when the edges are not sorted, O(m+m log n) otherwise, where n is the number of vertices, and m the number of edges.
|Constructor and Description|
Creates a new GreedyMaximumCardinalityMatching instance.
|Modifier and Type||Method and Description|
Get a matching that is a 1/2-approximation of the maximum cardinality matching.
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public MatchingAlgorithm.Matching<V,E> getMatching()
Copyright © 2017. All rights reserved.