How to Install and Uninstall libghc-topograph-prof Package on Kali Linux
Last updated: November 22,2024
1. Install "libghc-topograph-prof" package
This tutorial shows how to install libghc-topograph-prof on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libghc-topograph-prof
Copied
2. Uninstall "libghc-topograph-prof" package
Learn how to uninstall libghc-topograph-prof on Kali Linux:
$
sudo apt remove
libghc-topograph-prof
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libghc-topograph-prof package on Kali Linux
Package: libghc-topograph-prof
Source: haskell-topograph (1.0.0.2-2)
Version: 1.0.0.2-2+b2
Installed-Size: 228
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-topograph-prof-1.0.0.2-4ddf4
Depends: libghc-base-compat-prof-0.12.3-6dc1c, libghc-base-orphans-prof-0.9.1-68b56, libghc-base-prof-4.17.2.0-68dfe, libghc-containers-prof-0.6.7-a1650, libghc-topograph-dev (= 1.0.0.2-2+b2), libghc-vector-prof-0.13.1.0-1ffee
Size: 37384
SHA256: e8300d2b0c7f36bf1ffcf782216b1028732036edfd697b772e707eaf458bf1d0
SHA1: b7d5caab6393eff2883883b11c382b5dc3069ad9
MD5sum: b49e82163b8a5ea8f17b11e7a3842893
Description: directed acyclic graphs; profiling libraries
Directed acyclic graphs can be sorted topographically.
Existence of topographic ordering allows writing many graph
algorithms efficiently. Many graphs, including most
dependency graphs, are acyclic.
.
There are some algorithms built in: dfs, transpose, transitive
closure, transitive reduction, etc.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://github.com/phadej/topograph
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-topograph/libghc-topograph-prof_1.0.0.2-2+b2_amd64.deb
Source: haskell-topograph (1.0.0.2-2)
Version: 1.0.0.2-2+b2
Installed-Size: 228
Maintainer: Debian Haskell Group
Architecture: amd64
Provides: libghc-topograph-prof-1.0.0.2-4ddf4
Depends: libghc-base-compat-prof-0.12.3-6dc1c, libghc-base-orphans-prof-0.9.1-68b56, libghc-base-prof-4.17.2.0-68dfe, libghc-containers-prof-0.6.7-a1650, libghc-topograph-dev (= 1.0.0.2-2+b2), libghc-vector-prof-0.13.1.0-1ffee
Size: 37384
SHA256: e8300d2b0c7f36bf1ffcf782216b1028732036edfd697b772e707eaf458bf1d0
SHA1: b7d5caab6393eff2883883b11c382b5dc3069ad9
MD5sum: b49e82163b8a5ea8f17b11e7a3842893
Description: directed acyclic graphs; profiling libraries
Directed acyclic graphs can be sorted topographically.
Existence of topographic ordering allows writing many graph
algorithms efficiently. Many graphs, including most
dependency graphs, are acyclic.
.
There are some algorithms built in: dfs, transpose, transitive
closure, transitive reduction, etc.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.
Description-md5:
Homepage: https://github.com/phadej/topograph
Section: haskell
Priority: optional
Filename: pool/main/h/haskell-topograph/libghc-topograph-prof_1.0.0.2-2+b2_amd64.deb