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

Packages that use PrimsMinimumSpanningTree.Adapter

Package	Description
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical	Hierarchical agglomerative clustering (HAC).
de.lmu.ifi.dbs.elki.math.geometry	Algorithms from computational geometry
de.lmu.ifi.dbs.elki.visualization.parallel3d.layout	Layouting algorithms for 3D parallel coordinate plots.

Uses of PrimsMinimumSpanningTree.Adapter in de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical

Classes in de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical that implement PrimsMinimumSpanningTree.Adapter

Modifier and Type	Class and Description
protected static class	AbstractHDBSCAN.HDBSCANAdapter Class for processing the HDBSCAN G_mpts graph.

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.
static <T> void	PrimsMinimumSpanningTree.processDense(T data, PrimsMinimumSpanningTree.Adapter<T> adapter, PrimsMinimumSpanningTree.Collector collector) Run Prim's algorithm on a dense graph.

Uses of PrimsMinimumSpanningTree.Adapter in de.lmu.ifi.dbs.elki.visualization.parallel3d.layout

Classes in de.lmu.ifi.dbs.elki.visualization.parallel3d.layout that implement PrimsMinimumSpanningTree.Adapter

Modifier and Type	Class and Description
private static class	AbstractLayout3DPC.LowerTriangularAdapter Class to use a lower-triangular similarity matrix for distance-based Prim's spanning tree.