How to Install and Uninstall planarity.i686 Package on Fedora 38

Last updated: November 27,2024

1. Install "planarity.i686" package

This is a short guide on how to install planarity.i686 on Fedora 38


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                planarity.i686
            
                    
    
    Copied

2. Uninstall "planarity.i686" package

Please follow the steps below to uninstall planarity.i686 on Fedora 38:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                planarity.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the planarity.i686 package on Fedora 38

Last metadata expiration check: 4:30:18 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : planarity
Version : 3.0.2.0
Release : 2.fc38
Architecture : i686
Size : 93 k
Source : planarity-3.0.2.0-2.fc38.src.rpm
Repository : fedora
Summary : Implementations of several planarity-related graph algorithms
URL : https://github.com/graph-algorithms/edge-addition-planarity-suite
License : BSD-3-Clause
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.