Clusters all leafs by focusing on the euclidean distance. Recursively merges two of the remaining clusters to one parentcluster, until only one is left. The last cluster contains all leafs on one side of the root, structured as a binary tree. (Each detected tree will be stored)

Determines whether the specified Object is equal to the current Object.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

Serves as a hash function for a particular type. GetHashCode()()() is suitable for use in hashing algorithms and data structures like a hash table.

Gets the Type of the current instance.

Creates a shallow copy of the current Object.

Returns a String that represents the current Object.