How to Install and Uninstall permlib-devel Package on openSUSE Leap
Last updated: November 23,2024
1. Install "permlib-devel" package
Please follow the guidance below to install permlib-devel on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
permlib-devel
Copied
2. Uninstall "permlib-devel" package
In this section, we are going to explain the necessary steps to uninstall permlib-devel on openSUSE Leap:
$
sudo zypper remove
permlib-devel
Copied
3. Information about the permlib-devel package on openSUSE Leap
Information for package permlib-devel:
--------------------------------------
Repository : Main Repository
Name : permlib-devel
Version : 0.2.9-bp155.2.11
Arch : noarch
Vendor : openSUSE
Installed Size : 453.7 KiB
Installed : No
Status : not installed
Source package : permlib-0.2.9-bp155.2.11.src
Upstream URL : http://www.math.uni-rostock.de/~rehn/software/permlib.html
Summary : Header files for permlib, a permutation computation library
Description :
PermLib is a C++ library for permutation computations. It is
implemented in C++ header files only.
Currently, it supports set stabilizer and in-orbit computations,
based on bases and strong generating sets (BSGS). Additionally, it
computes automorphisms of symmetric matrices and find the
lexicographically smallest set in an orbit of sets. It also features
a very basic recognition of permutation group types.
--------------------------------------
Repository : Main Repository
Name : permlib-devel
Version : 0.2.9-bp155.2.11
Arch : noarch
Vendor : openSUSE
Installed Size : 453.7 KiB
Installed : No
Status : not installed
Source package : permlib-0.2.9-bp155.2.11.src
Upstream URL : http://www.math.uni-rostock.de/~rehn/software/permlib.html
Summary : Header files for permlib, a permutation computation library
Description :
PermLib is a C++ library for permutation computations. It is
implemented in C++ header files only.
Currently, it supports set stabilizer and in-orbit computations,
based on bases and strong generating sets (BSGS). Additionally, it
computes automorphisms of symmetric matrices and find the
lexicographically smallest set in an orbit of sets. It also features
a very basic recognition of permutation group types.