How to Install and Uninstall libocamlgraph-ocaml-dev Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 09,2024

1. Install "libocamlgraph-ocaml-dev" package

Please follow the step by step instructions below to install libocamlgraph-ocaml-dev on Ubuntu 16.04 LTS (Xenial Xerus)

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

2. Uninstall "libocamlgraph-ocaml-dev" package

Please follow the steps below to uninstall libocamlgraph-ocaml-dev on Ubuntu 16.04 LTS (Xenial Xerus):

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

3. Information about the libocamlgraph-ocaml-dev package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libocamlgraph-ocaml-dev
Priority: optional
Section: universe/libdevel
Installed-Size: 10092
Maintainer: Ubuntu Developers
Original-Maintainer: Debian OCaml Maintainers
Architecture: amd64
Source: ocamlgraph
Version: 1.8.6-1build2
Provides: libocamlgraph-ocaml-dev-hhuo1
Depends: ocaml-nox-4.02.3, libc6 (>= 2.2.5)
Recommends: ocaml-findlib
Filename: pool/universe/o/ocamlgraph/libocamlgraph-ocaml-dev_1.8.6-1build2_amd64.deb
Size: 1196162
MD5sum: dc3ccd4842948b17256e542bb62dfc58
SHA1: 8e602cba4e59fb586ca1652ed60c6388ef2cea74
SHA256: b3ecedf60c600e4c87a5c9fc6d0e2fd70e163fe7b4ebaa532014097f9fbca09a
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
Homepage: http://ocamlgraph.lri.fr/
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu