Safe Haskell | Safe-Infered |
---|

- singleLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram a
- completeLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram a
- upgma :: [a] -> (a -> a -> Distance) -> Dendrogram a
- fakeAverageLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram a

# Documentation

singleLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram aSource

*O(n^3)* time and *O(n^2)* space. Calculates a complete,
rooted dendrogram for a list of items using single linkage
with the naïve algorithm using a distance matrix.

completeLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram aSource

*O(n^3)* time and *O(n^2)* space. Calculates a complete,
rooted dendrogram for a list of items using complete linkage
with the naïve algorithm using a distance matrix.

upgma :: [a] -> (a -> a -> Distance) -> Dendrogram aSource

*O(n^3)* time and *O(n^2)* space. Calculates a complete,
rooted dendrogram for a list of items using UPGMA with the
naïve algorithm using a distance matrix.

fakeAverageLinkage :: [a] -> (a -> a -> Distance) -> Dendrogram aSource

*O(n^3)* time and *O(n^2)* space. Calculates a complete,
rooted dendrogram for a list of items using fake average
linkage with the naïve algorithm using a distance matrix.