How to Install and Uninstall libghc-hierarchical-clustering-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: November 22,2024

1. Install "libghc-hierarchical-clustering-dev" package

Please follow the guidance below to install libghc-hierarchical-clustering-dev on Ubuntu 21.10 (Impish Indri)

$ sudo apt update $ sudo apt install libghc-hierarchical-clustering-dev

2. Uninstall "libghc-hierarchical-clustering-dev" package

Please follow the instructions below to uninstall libghc-hierarchical-clustering-dev on Ubuntu 21.10 (Impish Indri):

$ sudo apt remove libghc-hierarchical-clustering-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libghc-hierarchical-clustering-dev package on Ubuntu 21.10 (Impish Indri)

Package: libghc-hierarchical-clustering-dev
Architecture: amd64
Version: 0.4.7-1build2
Priority: extra
Section: universe/haskell
Source: haskell-hierarchical-clustering
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Haskell Group
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 694
Provides: libghc-hierarchical-clustering-dev-0.4.7-1bc71
Depends: libghc-array-dev-0.5.4.0-ddbb2, libghc-base-dev-4.13.0.0-2f220, libghc-containers-dev-0.6.2.1-ab1cf, libc6 (>= 2.2.5), libgmp10
Suggests: libghc-hierarchical-clustering-doc, libghc-hierarchical-clustering-prof
Filename: pool/universe/h/haskell-hierarchical-clustering/libghc-hierarchical-clustering-dev_0.4.7-1build2_amd64.deb
Size: 85808
MD5sum: 10ad223a81a3f7dc5cec76681601c2f7
SHA1: 7e5f7b5a74fe4a5c76d7030e61808f1947f62624
SHA256: dc9eeb09b6638c6fca511762f426aa973573a61e5c40a337b213f9c221f66e51
SHA512: e28e60b65efebb12e0e0fd3a0bd6f8c1235b4e690c4db39b8a70dd365dd9cd7129f854ae6b638fe8990819ea32e736fa97e176b7786add8ff9301e84ce3a8ddd
Homepage: https://hackage.haskell.org/package/hierarchical-clustering
Description-en: fast algorithms for single, average/UPGMA and complete linkage clustering
This package provides a function to create a dendrogram from a
list of items and a distance function between them. Initially
a singleton cluster is created for each item, and then new,
bigger clusters are created by merging the two clusters with
least distance between them. The distance between two clusters
is calculated according to the linkage type. The dendrogram
represents not only the clusters but also the order on which
they were created.
.
This package has many implementations with different
performance characteristics. There are SLINK and CLINK
algorithm implementations that are optimal in both space and
time. There are also naive implementations using a distance
matrix. Using the dendrogram function from
Data.Clustering.Hierarchical automatically chooses the best
implementation we have.
.
This package provides a library for the Haskell programming language.
See http://www.haskell.org/ for more information on Haskell.
Description-md5: 446338fd13896c9759f6319059ab9b57
Ghc-Package: hierarchical-clustering-0.4.7-Cygyc1OFL9mHkRf0Kma1fK