How to Install and Uninstall libcneartree7 Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 19,2024

1. Install "libcneartree7" package

Learn how to install libcneartree7 on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libcneartree7
            
                    
    
    Copied

2. Uninstall "libcneartree7" package

This guide covers the steps necessary to uninstall libcneartree7 on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libcneartree7
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libcneartree7 package on Ubuntu 20.10 (Groovy Gorilla)

Package: libcneartree7
Architecture: amd64
Version: 5.1.1+dfsg1-1
Multi-Arch: same
Priority: optional
Section: universe/libs
Source: neartree
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 89
Depends: libc6 (>= 2.4), libcvector2 (>= 1.0.3)
Filename: pool/universe/n/neartree/libcneartree7_5.1.1+dfsg1-1_amd64.deb
Size: 27228
MD5sum: fb8a9c8a5c1b075c329122e06b3eae52
SHA1: 5015089ef24de21f5f98a2d6f4d746ce7e6c7345
SHA256: b9b8495507f59e051279559b9c46eded30b181700ad809a19f9d1a76e57f7af4
SHA512: 1a468d361293af8764b68976a2a2033fe01698b38d0368373650a667efcbd694e652dbaba6ddfa96d558f74bb44ac24b7f75e1a2a307b54a114a9f478b782021
Homepage: http://neartree.sourceforge.net/
Description-en: Library for solving the Nearest Neighbor Problem
Neartree is an API and a library for finding nearest neighbors among
points in spaces of arbitrary dimensions.
.
The library uses the Nearest Neighbor algorithm after Kalantari and
McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp.
631-634,1983) modified to use recursion instead of a double-linked tree
and simplified so that it does less checking for things like is the
distance to the right less than the distance to the left; it was found
that these checks make little to no difference.
Description-md5: 0798d851391cb5df04b3fbbb913c918c