How to Install and Uninstall ghc-algebraic-graphs Package on openSUSE Leap

Last updated: November 23,2024

1. Install "ghc-algebraic-graphs" package

Here is a brief guide to show you how to install ghc-algebraic-graphs on openSUSE Leap


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                ghc-algebraic-graphs
            
                    
    
    Copied

2. Uninstall "ghc-algebraic-graphs" package

Please follow the instructions below to uninstall ghc-algebraic-graphs on openSUSE Leap:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                ghc-algebraic-graphs
            
                    
    
    Copied

3. Information about the ghc-algebraic-graphs package on openSUSE Leap

Information for package ghc-algebraic-graphs:
---------------------------------------------
Repository : Main Repository
Name : ghc-algebraic-graphs
Version : 0.6-bp155.2.14
Arch : x86_64
Vendor : openSUSE
Installed Size : 2.2 MiB
Installed : No
Status : not installed
Source package : ghc-algebraic-graphs-0.6-bp155.2.14.src
Upstream URL : https://hackage.haskell.org/package/algebraic-graphs
Summary : A library for algebraic graph construction and transformation
Description :
is a library for algebraic
construction and manipulation of graphs in Haskell. See
for the motivation
behind the library, the underlying theory and implementation details.
The top-level module
Algebra.Graph> defines the main data type for /algebraic graphs/
Graph>, as well as associated algorithms. For type-safe representation and
manipulation of /non-empty algebraic graphs/, see
Algebra.Graph.NonEmpty>. Furthermore, /algebraic graphs with edge labels/ are
implemented in
Algebra.Graph.Labelled>.
The library also provides conventional graph data structures, such as
Algebra.Graph.AdjacencyMap> along with its various flavours:
* adjacency maps specialised to graphs with vertices of type 'Int'
( Algebra.Graph.AdjacencyIntMap>), * non-empty adjacency maps
( Algebra.Graph.NonEmpty.AdjacencyMap>), * adjacency maps for undirected
bipartite graphs
( Algebra.Graph.Bipartite.AdjacencyMap>), * adjacency maps with edge labels
( Algebra.Graph.Labelled.AdjacencyMap>), * acyclic adjacency maps
( Algebra.Graph.Acyclic.AdjacencyMap>),
A large part of the API of algebraic graphs and adjacency maps is available
through the 'Foldable'-like type class
Algebra.Graph.ToGraph>.
The type classes defined in
Algebra.Graph.Class> and
Algebra.Graph.HigherKinded.Class> can be used for polymorphic construction and
manipulation of graphs.
This is an experimental library and the API is expected to remain unstable
until version 1.0.0. Please consider contributing to the on-going
.