How to Install and Uninstall libocamlgraph-ocaml-dev Package on Kali Linux

Last updated: December 23,2024

1. Install "libocamlgraph-ocaml-dev" package

This guide covers the steps necessary to install libocamlgraph-ocaml-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libocamlgraph-ocaml-dev
            
                    
    
    Copied

2. Uninstall "libocamlgraph-ocaml-dev" package

This guide covers the steps necessary to uninstall libocamlgraph-ocaml-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libocamlgraph-ocaml-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libocamlgraph-ocaml-dev package on Kali Linux

Package: libocamlgraph-ocaml-dev
Source: ocamlgraph (2.1.0-1)
Version: 2.1.0-1+b1
Installed-Size: 23889
Maintainer: Debian OCaml Maintainers
Architecture: amd64
Provides: libocamlgraph-ocaml-dev-rbua8
Depends: libstdlib-ocaml-dev-ep7y0, ocaml-4.14.1
Recommends: ocaml-findlib
Size: 5095372
SHA256: 54368ec0088d4b4e2fa650333869a1b047a771a42ed322fd714986ce6a502f71
SHA1: d5ff7bc55f90f35342d51a182ba9578461c7d059
MD5sum: 0cbdacfa63bb77d18971cef6678f2619
Description: 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:
Homepage: http://ocamlgraph.lri.fr/
Tag: devel::lang:ocaml, devel::library, implemented-in::ocaml,
role::devel-lib
Section: ocaml
Priority: optional
Filename: pool/main/o/ocamlgraph/libocamlgraph-ocaml-dev_2.1.0-1+b1_amd64.deb