How to Install and Uninstall permlib-devel Package on openSuSE Tumbleweed
Last updated: November 26,2024
1. Install "permlib-devel" package
Here is a brief guide to show you how to install permlib-devel on openSuSE Tumbleweed
$
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 Tumbleweed:
$
sudo zypper remove
permlib-devel
Copied
3. Information about the permlib-devel package on openSuSE Tumbleweed
Information for package permlib-devel:
--------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : permlib-devel
Version : 0.2.9-1.14
Arch : noarch
Vendor : openSUSE
Installed Size : 453.7 KiB
Installed : No
Status : not installed
Source package : permlib-0.2.9-1.14.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 : openSUSE-Tumbleweed-Oss
Name : permlib-devel
Version : 0.2.9-1.14
Arch : noarch
Vendor : openSUSE
Installed Size : 453.7 KiB
Installed : No
Status : not installed
Source package : permlib-0.2.9-1.14.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.