How to Install and Uninstall libbtf1 Package on Kali Linux

Last updated: May 08,2024

Deprecated! Installation of this package may no longer be supported.

1. Install "libbtf1" package

In this section, we are going to explain the necessary steps to install libbtf1 on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libbtf1
            
                    
    
    Copied

2. Uninstall "libbtf1" package

Please follow the guidelines below to uninstall libbtf1 on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libbtf1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libbtf1 package on Kali Linux

Package: libbtf1
Source: suitesparse
Version: 1:5.12.0+dfsg-2
Installed-Size: 60
Maintainer: Debian Science Team
Architecture: amd64
Depends: libc6 (>= 2.2.5)
Size: 25636
SHA256: 4c854577ea0585d93a73322f8aa7d91c28f731c335d0bb3e82ecacdf2a7ad282
SHA1: 8545e3cadb125f21634681a96168e4d613176e63
MD5sum: e56a8a370a9d648a28837ea31e05aa61
Description: permutation to block triangular form library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The BTF library is a software package for permuting a matrix into Block upper
Triangular Form. It includes a maximum transversal algorithm, which finds a
permutation of a square or rectangular matrix so that it has a zero-free
diagonal (if one exists); otherwise, it finds a maximal matching which
maximizes the number of nonzeros on the diagonal. The package also includes a
method for finding the strongly connected components of a graph. These two
methods together give the permutation to block upper triangular form.
Description-md5: 051b2cdc9ff424226df9ac31bfffed85
Multi-Arch: same
Homepage: http://suitesparse.com
Tag: role::shared-lib
Section: libs
Priority: optional
Filename: pool/main/s/suitesparse/libbtf1_5.12.0+dfsg-2_amd64.deb