de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical

Class AbstractHDBSCAN.HeapMSTCollector

java.lang.Object

de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AbstractHDBSCAN.HeapMSTCollector

All Implemented Interfaces:

PrimsMinimumSpanningTree.Collector

Enclosing class:

AbstractHDBSCAN<O,R extends Result>

public static class AbstractHDBSCAN.HeapMSTCollector
extends Object
implements PrimsMinimumSpanningTree.Collector

Class for collecting the minimum spanning tree edges into a heap.

Author:

Erich Schubert

Field Summary

Fields

Modifier and Type	Field and Description
private DoubleLongHeap	heap Output heap.
private Logging	log Logger, for progress logging.
private FiniteProgress	prog Progress, for progress logging.

Constructor Summary

Constructors

Constructor and Description
HeapMSTCollector(DoubleLongHeap heap, FiniteProgress prog, Logging log) Constructor.

Method Summary

Modifier and Type	Method and Description
void	addEdge(double length, int i, int j) Add a new edge to the output.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

heap

private DoubleLongHeap heap

Output heap.

prog

private FiniteProgress prog

Progress, for progress logging.

log

private Logging log

Logger, for progress logging.

Constructor Detail

HeapMSTCollector

public HeapMSTCollector(DoubleLongHeap heap,
                        FiniteProgress prog,
                        Logging log)

Constructor.

Parameters:

heap - Output heap.

prog - Progress for logging. May be null.

log - Logger for logging. May be null.

Method Detail

addEdge

public void addEdge(double length,
                    int i,
                    int j)

Description copied from interface: PrimsMinimumSpanningTree.Collector

Add a new edge to the output.

Specified by:

addEdge in interface PrimsMinimumSpanningTree.Collector

Parameters:

length - Length of edge

i - Source node

j - Destination node