V
- the graph vertex typeE
- the graph edge typepublic static interface MatchingAlgorithm.Matching<V,E> extends Iterable<E>
Modifier and Type | Method and Description |
---|---|
Set<E> |
getEdges()
Get the edges of the matching.
|
Graph<V,E> |
getGraph()
Returns the graph over which this matching is defined.
|
double |
getWeight()
Returns the weight of the matching.
|
default boolean |
isMatched(V v)
Returns true if vertex v is incident to an edge in this matching.
|
default boolean |
isPerfect()
Returns true if the matching is a perfect matching.
|
default Iterator<E> |
iterator()
Returns an iterator over the edges in the matching.
|
forEach, spliterator
Graph<V,E> getGraph()
double getWeight()
default boolean isMatched(V v)
v
- vertexdefault boolean isPerfect()
Copyright © 2018. All rights reserved.