public class SetTools<E>
extends java.lang.Object
Constructor and Description |
---|
SetTools() |
Modifier and Type | Method and Description |
---|---|
java.util.Set<java.util.Set<java.util.Set<E>>> |
getBipartitions(java.util.Set<E> set)
Computes every bipartition of the given set, e.g.
|
java.util.Set<E> |
getUnion(java.util.Set<java.util.Set<E>> sets)
Returns the union of the set of sets.
|
boolean |
hasEmptyIntersection(java.util.Set<java.util.Set<E>> sets)
Checks whether the given set of sets has an empty intersection
|
java.util.Set<java.util.Set<java.util.Collection<E>>> |
independentSets(java.util.Set<java.util.Collection<E>> sets,
int cardinality)
Returns all independent sets of the given cardinality of the given set of sets.
|
java.util.Set<java.util.Set<E>> |
irreducibleHittingSets(java.util.Set<java.util.Set<E>> sets)
Computes the set of irreducible hitting sets of "sets".
|
boolean |
isIndependent(java.util.Set<java.util.Collection<E>> set)
Checks whether the given set of sets is independent, i.e.
|
java.util.Set<java.util.Set<E>> |
permutations(java.util.Set<java.util.Set<E>> partitions)
Computes all permutations of elements in partitions as follows.
|
java.util.Set<java.util.Set<E>> |
subsets(java.util.Collection<? extends E> elements)
This method computes all subsets of the given set of elements
of class "E".
|
java.util.Set<java.util.Set<E>> |
subsets(java.util.Collection<? extends E> elements,
int size)
This method computes all subsets of the given set of elements
of class "E" with the given size.
|
java.util.Set<E> |
symmetricDifference(java.util.Collection<E> s,
java.util.Collection<E> t)
Returns the symmetric difference of the two sets s and t, i.e.
|
public java.util.Set<java.util.Set<E>> subsets(java.util.Collection<? extends E> elements)
elements
- a set of elements of class "E".public java.util.Set<java.util.Set<E>> subsets(java.util.Collection<? extends E> elements, int size)
elements
- a set of elements of class "E".size
- some int.public java.util.Set<java.util.Set<E>> permutations(java.util.Set<java.util.Set<E>> partitions)
partitions
- a set of sets of E.public java.util.Set<java.util.Set<E>> irreducibleHittingSets(java.util.Set<java.util.Set<E>> sets)
sets
- a set of setspublic boolean hasEmptyIntersection(java.util.Set<java.util.Set<E>> sets)
sets
- some set of setspublic java.util.Set<E> getUnion(java.util.Set<java.util.Set<E>> sets)
sets
- some set of setspublic java.util.Set<java.util.Set<java.util.Set<E>>> getBipartitions(java.util.Set<E> set)
set
- a set of Epublic java.util.Set<E> symmetricDifference(java.util.Collection<E> s, java.util.Collection<E> t)
s
- some sett
- some setpublic java.util.Set<java.util.Set<java.util.Collection<E>>> independentSets(java.util.Set<java.util.Collection<E>> sets, int cardinality)
sets
- a set of setspublic boolean isIndependent(java.util.Set<java.util.Collection<E>> set)
set
- a set of sets