How to Install and Uninstall libsemigroups2 Package on openSUSE Leap
Last updated: December 26,2024
1. Install "libsemigroups2" package
Please follow the instructions below to install libsemigroups2 on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libsemigroups2
Copied
2. Uninstall "libsemigroups2" package
This guide covers the steps necessary to uninstall libsemigroups2 on openSUSE Leap:
$
sudo zypper remove
libsemigroups2
Copied
3. Information about the libsemigroups2 package on openSUSE Leap
Information for package libsemigroups2:
---------------------------------------
Repository : Main Repository
Name : libsemigroups2
Version : 2.3.2-bp155.1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.0 MiB
Installed : No
Status : not installed
Source package : libsemigroups-2.3.2-bp155.1.7.src
Upstream URL : https://github.com/libsemigroups/libsemigroups
Summary : Library with algorithms for computing finite and finitely presented semigroups
Description :
A C++14 library containing implementations of several algorithms for
computing finite and finitely presented semigroups, namely:
* the Froidure-Pin algorithm for computing finite semigroups
* the Todd-Coxeter algorithm for finitely presented semigroups and monoids;
* the Knuth-Bendix algorithm for finitely presented semigroups and monoids;
* the Schreier-Sims algorithm for permutation groups.
---------------------------------------
Repository : Main Repository
Name : libsemigroups2
Version : 2.3.2-bp155.1.7
Arch : x86_64
Vendor : openSUSE
Installed Size : 1.0 MiB
Installed : No
Status : not installed
Source package : libsemigroups-2.3.2-bp155.1.7.src
Upstream URL : https://github.com/libsemigroups/libsemigroups
Summary : Library with algorithms for computing finite and finitely presented semigroups
Description :
A C++14 library containing implementations of several algorithms for
computing finite and finitely presented semigroups, namely:
* the Froidure-Pin algorithm for computing finite semigroups
* the Todd-Coxeter algorithm for finitely presented semigroups and monoids;
* the Knuth-Bendix algorithm for finitely presented semigroups and monoids;
* the Schreier-Sims algorithm for permutation groups.