FarthestBalancedDistribution (ELKI: Environment for DeveLoping KDD-Applications Supported by Index-Structures)

java.lang.Object
- elki.index.tree.metrical.mtreevariants.strategies.split.distribution.FarthestBalancedDistribution

All Implemented Interfaces:

DistributionStrategy
```
public class FarthestBalancedDistribution
extends java.lang.Object
implements DistributionStrategy
```
Balanced entry distribution strategy of the M-tree, beginning with the most difficult points first. This should produce smaller covers.

Since:

0.7.5

Author:

Erich Schubert

Constructor Summary

Constructors
Constructor Description

FarthestBalancedDistribution()

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`<E extends MTreeEntry> Assignments<E>`	`distribute(AbstractNode<E> node, int routing1, double[] dis1, int routing2, double[] dis2)`	Creates a balanced partition of the entries of the specified node.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - FarthestBalancedDistribution
```
public FarthestBalancedDistribution()
```
- Method Detail
  - distribute
```
public <E extends MTreeEntry> Assignments<E> distribute(AbstractNode<E> node,
                                                        int routing1,
                                                        double[] dis1,
                                                        int routing2,
                                                        double[] dis2)
```
    Description copied from interface: DistributionStrategy
    
    Creates a balanced partition of the entries of the specified node.
    
    Specified by:
    
    distribute in interface DistributionStrategy
    
    Type Parameters:
    
    E - entry type
    
    Parameters:
    
    node - the node to be split
    
    routing1 - the entry number of the first routing object
    
    dis1 - Distances from first routing object
    
    routing2 - the entry number of the second routing object
    
    dis2 - Distances from second routing object
    
    Returns:
    
    an assignment that holds a balanced partition of the entries of the specified node