Interface | Description |
---|---|
IntDisjointSets |
Interface for disjoint-set forest implementations that operate on a universe of contiguous integers.
|
Class | Description |
---|---|
BitSetIterator |
Iterator for iterating over a BitSet like over a normal collection.
|
Holder<T> | |
IOUtil |
Utility methods for operating with
java.io.* classes. |
Pair<T1,T2> |
Immutable pair class.
|
ReflectUtil |
Utility methods for using Java reflection.
|
Triple<T1,T2,T3> |
Immutable triple class.
|
UnionFind |
The well-known disjoint-set forest data structure for dealing with partitions on a fixed-range integer domain.
|
UnionFindRemSP |
Implementation of a disjoint set (union-find) data structure for integers, based on Rem's algorithm, as described in
the paper Experiments on Union-Find Algorithms
for the Disjoint-Set Data Structure (M.
|
WrapperUtil |
Copyright © 2020. All rights reserved.