How to Install and Uninstall libocamlgraph-ocaml-dev Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 08,2024

1. Install "libocamlgraph-ocaml-dev" package

Here is a brief guide to show you how to install libocamlgraph-ocaml-dev on Ubuntu 21.04 (Hirsute Hippo)

$ sudo apt update $ sudo apt install libocamlgraph-ocaml-dev

2. Uninstall "libocamlgraph-ocaml-dev" package

Learn how to uninstall libocamlgraph-ocaml-dev on Ubuntu 21.04 (Hirsute Hippo):

$ sudo apt remove libocamlgraph-ocaml-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the libocamlgraph-ocaml-dev package on Ubuntu 21.04 (Hirsute Hippo)

Package: libocamlgraph-ocaml-dev
Architecture: amd64
Version: 1.8.8-1.1build2
Priority: optional
Section: universe/libdevel
Source: ocamlgraph
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OCaml Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 12723
Provides: libocamlgraph-ocaml-dev-2s466
Depends: ocaml-nox-4.11.1
Recommends: ocaml-findlib
Filename: pool/universe/o/ocamlgraph/libocamlgraph-ocaml-dev_1.8.8-1.1build2_amd64.deb
Size: 1671312
MD5sum: 96d9e10eba7c50f90f73d6f0d0f6ea62
SHA1: c05ac4533c1125a836d3e2a2c575f3be135cbd5c
SHA256: 11ae11ba6102acf275eb769182356d70d8ef1b904a00519f4c0b760c2a0ae9e3
SHA512: 55315874d1528b5834f250b487185b7b99f3bcb9c00b97ca7b83fce21e9c9b405cf4f193e31d2d0a683167322ed423fcfe84b95a39c499d997d6b7809e639fb5
Homepage: http://ocamlgraph.lri.fr/
Description-en: graph library for OCaml
Ocamlgraph is a graph library for OCaml. Its contribution is
three-fold:
.
* It provides an easy-to-use graph data structure together with
several operations and algorithms over graphs. It is a
reasonably efficient imperative data structure for directed
graphs with vertices and edges labeled with integers.
.
* Then ocamlgraph provides several other graph implementations
for those not satisfied with the one above. Some are
persistent (imutable) and other imperative (mutable). Some
are directed and other are not. Some have labels for
vertices, or labels for edges, or both. Some have abstract
types for vertices. etc.
These implementations are written as functors: you give the
types of vertices labels, edge labels, etc. and you get the
data structure as a result.
.
* Finally, ocamlgraph provides several classic operations and
algorithms over graphs.
They are also written as functors i.e. independently of the
data structure for graphs. One consequence is that you can
define your own data structure for graphs and yet re-use all
the algorithms from this library -- you only need to provide
a few operations such as iterating over all vertices, over
the successors of a vertex, etc.
Description-md5: 0d52e56efde08d1b966456e1b27134b5