| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.clustering | 
 Clustering algorithms
 
 Clustering algorithms are supposed to implement the  
Algorithm-Interface. | 
| Modifier and Type | Method and Description | 
|---|---|
private Cluster<DendrogramModel<D>> | 
SLINK.createParent(String name,
            Cluster<DendrogramModel<D>> leftChild,
            Cluster<DendrogramModel<D>> rightChild,
            D distance,
            ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier)  | 
private Clustering<DendrogramModel<D>> | 
SLINK.extractClusters(DBIDs ids,
               DataStore<DBID> pi,
               DataStore<D> lambda,
               int minclusters)
Extract all clusters from the pi-lambda-representation. 
 | 
private Cluster<DendrogramModel<D>> | 
SLINK.lastAncestor(Cluster<DendrogramModel<D>> cluster,
            ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier)
Determines recursively the last ancestor of the specified cluster. 
 | 
private Cluster<DendrogramModel<D>> | 
SLINK.root(Map<DBID,ModifiableDBIDs> cluster_ids,
    Map<DBID,D> cluster_distances,
    DataStore<DBID> pi,
    DataStore<D> lambda,
    ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier,
    FiniteProgress progress)  |