How to Install and Uninstall libbtf1.2.1 Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 02,2024

1. Install "libbtf1.2.1" package

This guide covers the steps necessary to install libbtf1.2.1 on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libbtf1.2.1
            
                    
    
    Copied

2. Uninstall "libbtf1.2.1" package

This guide let you learn how to uninstall libbtf1.2.1 on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libbtf1.2.1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libbtf1.2.1 package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libbtf1.2.1
Priority: optional
Section: libs
Installed-Size: 40
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Team
Architecture: amd64
Source: suitesparse
Version: 1:4.4.6-1
Depends: libc6 (>= 2.2.5)
Filename: pool/main/s/suitesparse/libbtf1.2.1_4.4.6-1_amd64.deb
Size: 10766
MD5sum: 5398dec5e1801ebabc695749538351ad
SHA1: 1634f31ba891676715f6cf54dd605ee8f1503404
SHA256: ab531eed77ed41f37853a58a6f5b452cd2ff48ae39f7940298fbf019911b7f1d
Description-en: 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://www.suitesparse.com
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Supported: 9m