Uses of Interface
de.lmu.ifi.dbs.elki.math.geometry.PrimsMinimumSpanningTree.Adapter

Packages that use PrimsMinimumSpanningTree.Adapter

Package	Description
de.lmu.ifi.dbs.elki.math.dimensionsimilarity	Functions to compute the similarity of dimensions (or the interestingness of the combination).
de.lmu.ifi.dbs.elki.math.geometry	Algorithms from computational geometry.

Uses of PrimsMinimumSpanningTree.Adapter in de.lmu.ifi.dbs.elki.math.dimensionsimilarity

Classes in de.lmu.ifi.dbs.elki.math.dimensionsimilarity that implement PrimsMinimumSpanningTree.Adapter

Modifier and Type	Class and Description
static class	DimensionSimilarityMatrix.PrimAdapter Adapter class for running prim's algorithm.

Uses of PrimsMinimumSpanningTree.Adapter in de.lmu.ifi.dbs.elki.math.geometry

Classes in de.lmu.ifi.dbs.elki.math.geometry that implement PrimsMinimumSpanningTree.Adapter

Modifier and Type	Class and Description
static class	PrimsMinimumSpanningTree.Array2DAdapter Adapter for a simple 2d double matrix.

Methods in de.lmu.ifi.dbs.elki.math.geometry with parameters of type PrimsMinimumSpanningTree.Adapter

Modifier and Type	Method and Description
static <T> int[]	PrimsMinimumSpanningTree.processDense(T data, PrimsMinimumSpanningTree.Adapter<T> adapter) Run Prim's algorithm on a dense graph.