ArgMinGeneric finds the nearest neighbour (with the smallest distance) for a node using its row from a distance matrix and only considering nodes greater than it.

ArgMinNN finds the nearest neighbour (with the smallest distance) for a node using its row from a distance matrix with a preference for another node if specified and excluding anything in "exclude".

ArgMinSingle finds the nearest neighbour (with the smallest distance) for a node using a distance vector.

Cluster clusters a square symmetric matrix and returns a dendrogram.

Generic clusters a distance matrix using a generic algorithm and one of the following linkage methods: centroid or median.

NearestNeighbor clusters a distance matrix using one of the following linkage methods: average, complete, mcquitty or ward.

Single clusters a distance matrix using the single (minimum) linkage method.

UpdateGeneric calculates the row/column to add to a distance matrix for a new node.

UpdateNN calculates the row/column to add to a distance matrix for a new node.