Package edu.uci.ics.jung.algorithms.util
package edu.uci.ics.jung.algorithms.util
Provides general algorithmic utilities. These include:
DiscreteDistribution
: calculates statistical measures on discrete probability distributions represented asdouble
arraysKMeansClusterer
: uses the k-means algorithm to cluster points in d-dimensional space into k clustersMapBinaryHeap
: a binary heap implementation that permits efficient element access and update operationsRandomLocationTransformer
: a class that randomly assigns 2D coordinates to items (default initializer for iterative Layouts)SettableTransformer
: an extension ofTransformer
that allows mutation of the transformation
-
ClassDescriptionBasicMapEntry<K,
V> An simple minimal implementation ofMap.Entry
.A utility class for calculating properties of discrete distributions.A class providing static methods useful for improving the performance of graph algorithms.An interface for algorithms that proceed iteratively.Provides basic infrastructure for iterative algorithms.Groups items into a specified number of clusters, based on their proximity in d-dimensional space, using the k-means algorithm.An exception that indicates that the specified data points cannot be clustered into the number of clusters requested by the user.An array-based binary heap implementation of a priority queue, which also provides efficientupdate()
andcontains
operations.ASettableTransformer
that operates on an underlyingMap
instance.APredicate
that returnstrue
if the input edge's endpoints in the input graph are identical.SettableTransformer<I,O> An interface for classes that can set the value to be returned (fromtransform()
) when invoked on a given input.Selects items according to their probability in an arbitrary probability distribution.