How to Install and Uninstall planarity.x86_64 Package on Fedora 35

Last updated: October 12,2024

1. Install "planarity.x86_64" package

Here is a brief guide to show you how to install planarity.x86_64 on Fedora 35


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                planarity.x86_64
            
                    
    
    Copied

2. Uninstall "planarity.x86_64" package

Here is a brief guide to show you how to uninstall planarity.x86_64 on Fedora 35:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                planarity.x86_64
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the planarity.x86_64 package on Fedora 35

Last metadata expiration check: 0:17:20 ago on Wed Sep 7 08:25:01 2022.
Available Packages
Name : planarity
Version : 3.0.1.1
Release : 2.fc35
Architecture : x86_64
Size : 84 k
Source : planarity-3.0.1.1-2.fc35.src.rpm
Repository : fedora
Summary : Implementations of several planarity-related graph algorithms
URL : https://github.com/graph-algorithms/edge-addition-planarity-suite
License : BSD
Description : This code project provides a library for implementing graph algorithms
: as well as implementations of several planarity-related graph algorithms.
: The origin of this project is the reference implementation for the Edge
: Addition Planarity Algorithm, which is now the fastest and simplest
: linear-time method for planar graph embedding and planarity obstruction
: isolation (i.e. Kuratowski subgraph isolation).
:
: The software in this code project provides a graph algorithm framework and
: library, including an updated version of the edge addition combinatorial
: planar graph embedder and planar obstruction isolator (i.e., a Kuratowski
: subgraph isolator). This code project also includes several extensions
: that implement planarity-related algorithms such as a planar graph drawing
: algorithm, an outerplanar graph embedder and outerplanar obstruction
: isolator, and a number of subgraph homeomorphism search algorithms.