Package | Description |
---|---|
lavesdk.algorithm | |
lavesdk.math | |
lavesdk.math.graph | |
lavesdk.math.graph.matching |
Modifier and Type | Method and Description |
---|---|
<E extends java.io.Serializable> |
AlgorithmState.addSet(java.lang.String key,
Set<E> set)
Adds a (mathematical) set to the state.
|
<E extends java.io.Serializable> |
AlgorithmState.getSet(java.lang.String key)
Gets a (mathematical) set for a given data key.
|
<E extends java.io.Serializable> |
AlgorithmState.getSet(java.lang.String key,
Set<E> defValue)
Gets a (mathematical) set for a given data key.
|
Modifier and Type | Method and Description |
---|---|
<E extends java.io.Serializable> |
AlgorithmState.addSet(java.lang.String key,
Set<E> set)
Adds a (mathematical) set to the state.
|
<E extends java.io.Serializable> |
AlgorithmState.getSet(java.lang.String key,
Set<E> defValue)
Gets a (mathematical) set for a given data key.
|
Modifier and Type | Method and Description |
---|---|
Set<E> |
Set.clone()
Gets a shallow copy of this set (the elements in the set are not cloned).
|
static <E> Set<E> |
Set.complement(Set<? extends E> set1,
Set<? extends E> set2)
Computes the complement of the two specified sets that means a set which contains only elements that
are in the first set but not in the second one.
|
static <E> Set<E> |
Set.intersection(java.util.Collection<Set<? extends E>> sets)
Computes the intersection of the specified sets in the given collection that means a set which contains only elements that
are in all the sets, but no other elements.
|
static <E> Set<E> |
Set.intersection(Set<? extends E>[] sets)
Computes the intersection of the specified sets in the given collection that means a set which contains only elements that
are in all the sets, but no other elements.
|
static <E> Set<E> |
Set.intersection(Set<? extends E> set1,
Set<? extends E> set2)
Computes the intersection of the two specified sets that means a set which contains only elements that
are in both sets, but no other elements.
|
static <E> Set<E> |
Set.parse(java.lang.String set,
ElementParser<E> parser)
Parses a string representation of a set into a
Set object. |
static <E> Set<E> |
Set.parse(java.lang.String set,
ElementParser<E> parser,
java.lang.String delimiter)
Parses a string representation of a set into a
Set object. |
static <E> Set<E> |
Set.symDifference(Set<? extends E> set1,
Set<? extends E> set2)
Computes the symmetric difference of the two specified sets which is defined as:
(set1 complement set2) union (set2 complement set1) |
static <E> Set<E> |
Set.union(java.util.Collection<Set<? extends E>> sets)
Computes the union of the specified sets in the given collection that means a set with all distinct elements
of the sets.
|
static <E> Set<E> |
Set.union(Set<? extends E>[] sets)
Computes the union of the specified sets in the given array that means a set with all distinct elements
of the sets.
|
static <E> Set<E> |
Set.union(Set<? extends E> set1,
Set<? extends E> set2)
Computes the union of the two specified sets that means a set with all distinct elements of set 1 and set 2.
|
Modifier and Type | Method and Description |
---|---|
static <E> Set<E> |
Set.complement(Set<? extends E> set1,
Set<? extends E> set2)
Computes the complement of the two specified sets that means a set which contains only elements that
are in the first set but not in the second one.
|
static <E> Set<E> |
Set.complement(Set<? extends E> set1,
Set<? extends E> set2)
Computes the complement of the two specified sets that means a set which contains only elements that
are in the first set but not in the second one.
|
static <E> Set<E> |
Set.intersection(Set<? extends E>[] sets)
Computes the intersection of the specified sets in the given collection that means a set which contains only elements that
are in all the sets, but no other elements.
|
static <E> Set<E> |
Set.intersection(Set<? extends E> set1,
Set<? extends E> set2)
Computes the intersection of the two specified sets that means a set which contains only elements that
are in both sets, but no other elements.
|
static <E> Set<E> |
Set.intersection(Set<? extends E> set1,
Set<? extends E> set2)
Computes the intersection of the two specified sets that means a set which contains only elements that
are in both sets, but no other elements.
|
static <E> Set<E> |
Set.symDifference(Set<? extends E> set1,
Set<? extends E> set2)
Computes the symmetric difference of the two specified sets which is defined as:
(set1 complement set2) union (set2 complement set1) |
static <E> Set<E> |
Set.symDifference(Set<? extends E> set1,
Set<? extends E> set2)
Computes the symmetric difference of the two specified sets which is defined as:
(set1 complement set2) union (set2 complement set1) |
static <E> Set<E> |
Set.union(Set<? extends E>[] sets)
Computes the union of the specified sets in the given array that means a set with all distinct elements
of the sets.
|
static <E> Set<E> |
Set.union(Set<? extends E> set1,
Set<? extends E> set2)
Computes the union of the two specified sets that means a set with all distinct elements of set 1 and set 2.
|
static <E> Set<E> |
Set.union(Set<? extends E> set1,
Set<? extends E> set2)
Computes the union of the two specified sets that means a set with all distinct elements of set 1 and set 2.
|
Modifier and Type | Method and Description |
---|---|
static <E> Set<E> |
Set.intersection(java.util.Collection<Set<? extends E>> sets)
Computes the intersection of the specified sets in the given collection that means a set which contains only elements that
are in all the sets, but no other elements.
|
static <E> Set<E> |
Set.union(java.util.Collection<Set<? extends E>> sets)
Computes the union of the specified sets in the given collection that means a set with all distinct elements
of the sets.
|
Modifier and Type | Method and Description |
---|---|
Set<java.lang.Integer> |
Graph.getEdgeByIDSet()
Gets the edge set containing the identifiers of all edges the graph consists of currently.
|
Set<E> |
Graph.getEdgeSet()
Gets the edge set of all edges the graph consists of currently.
|
Set<java.lang.Integer> |
Graph.getVertexByIDSet()
Gets the vertex set containing the identifiers of all vertices the graph consists of currently.
|
Set<V> |
Graph.getVertexSet()
Gets the vertex set of all vertices the graph consists of currently.
|
Modifier and Type | Class and Description |
---|---|
class |
Matching<E extends Edge>
Represents a matching.
|
class |
MatchingByID<E extends Edge>
Represents a matching using the identifiers of
Edge s. |