How to Install and Uninstall liblibleidenalg1 Package on Kali Linux

Last updated: December 25,2024

1. Install "liblibleidenalg1" package

This guide let you learn how to install liblibleidenalg1 on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                liblibleidenalg1
            
                    
    
    Copied

2. Uninstall "liblibleidenalg1" package

In this section, we are going to explain the necessary steps to uninstall liblibleidenalg1 on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                liblibleidenalg1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the liblibleidenalg1 package on Kali Linux

Package: liblibleidenalg1
Source: libleidenalg
Version: 0.11.1-2
Installed-Size: 184
Maintainer: Debian Med Packaging Team
Architecture: amd64
Depends: libc6 (>= 2.29), libgcc-s1 (>= 3.0), libigraph3 (>= 0.10.0), libstdc++6 (>= 13.1)
Size: 54320
SHA256: f9b5ec46a1916e55b3a35ce963e9ccb512cb8abc869514a4d35b886b05239ab9
SHA1: 0c4537c23cc811dcd44f07f8096584a14ff8a970
MD5sum: 15d394d42747008dfbcb108a215d6d66
Description: implementation of the Leiden algorithm in C++ - library
This package implements the Leiden algorithm in C++. It relies on igraph for
it to function. Besides the relative flexibility of the implementation, it
also scales well, and can be run on graphs of millions of nodes (as long as
they can fit in memory). The core class is Optimiser which finds the optimal
partition using the Leiden algorithm, which is an extension of the Louvain
algorithm for a number of different methods. The methods currently implemented
are (1) modularity, (2) Reichardt and Bornholdt's model using the
configuration null model and the Erdös-Rényi null model, (3) the Constant
Potts model (CPM), (4) Significance, and finally (5) Surprise. In addition,
it supports multiplex partition optimisation allowing community detection on
for example negative links or multiple time slices. There is the possibility
of only partially optimising a partition, so that some community assignments
remain fixed. It also provides some support for community detection on
bipartite graphs.
.
This package contains the library.
Description-md5:
Multi-Arch: same
Homepage: https://github.com/vtraag/libleidenalg
Section: libs
Priority: optional
Filename: pool/main/libl/libleidenalg/liblibleidenalg1_0.11.1-2_amd64.deb