Package | Description |
---|---|
lavesdk.algorithm | |
lavesdk.math.graph.matching |
Modifier and Type | Method and Description |
---|---|
<E extends Edge> |
AlgorithmState.addMatching(java.lang.String key,
MatchingByID<E> m)
Adds a matching to the state.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getMatching(java.lang.String key,
Graph<V,E> graph)
Gets a matching for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getMatching(java.lang.String key,
Graph<V,E> graph,
MatchingByID<E> defValue)
Gets a matching for a given data key.
|
Modifier and Type | Method and Description |
---|---|
<E extends Edge> |
AlgorithmState.addMatching(java.lang.String key,
MatchingByID<E> m)
Adds a matching to the state.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getMatching(java.lang.String key,
Graph<V,E> graph,
MatchingByID<E> defValue)
Gets a matching for a given data key.
|
Modifier and Type | Method and Description |
---|---|
MatchingByID<E> |
Matching.cast()
Converts this matching using concrete
Edge s in a MatchingByID using edge identifiers. |
MatchingByID<E> |
MatchingByID.clone()
Gets a shallow copy of this matching (the elements in the matching are not cloned).
|
Constructor and Description |
---|
MatchingByID(MatchingByID<E> m)
Creates a matching based on another matching meaning the elements of the base matching are added to this matching.
|