How to Install and Uninstall perl-Algorithm-Combinatorics Package on openSUSE Leap
Last updated: November 23,2024
1. Install "perl-Algorithm-Combinatorics" package
Please follow the guidance below to install perl-Algorithm-Combinatorics on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
perl-Algorithm-Combinatorics
Copied
2. Uninstall "perl-Algorithm-Combinatorics" package
Please follow the guidelines below to uninstall perl-Algorithm-Combinatorics on openSUSE Leap:
$
sudo zypper remove
perl-Algorithm-Combinatorics
Copied
3. Information about the perl-Algorithm-Combinatorics package on openSUSE Leap
Information for package perl-Algorithm-Combinatorics:
-----------------------------------------------------
Repository : Main Repository
Name : perl-Algorithm-Combinatorics
Version : 0.27-bp155.2.11
Arch : x86_64
Vendor : openSUSE
Installed Size : 70.9 KiB
Installed : No
Status : not installed
Source package : perl-Algorithm-Combinatorics-0.27-bp155.2.11.src
Upstream URL : http://search.cpan.org/dist/Algorithm-Combinatorics/
Summary : Efficient generation of combinatorial sequences
Description :
Algorithm::Combinatorics is an efficient generator of combinatorial
sequences. Algorithms are selected from the literature (work in progress,
see the /REFERENCES manpage). Iterators do not use recursion, nor stacks,
and are written in C.
Tuples are generated in lexicographic order, except in 'subsets()'.
-----------------------------------------------------
Repository : Main Repository
Name : perl-Algorithm-Combinatorics
Version : 0.27-bp155.2.11
Arch : x86_64
Vendor : openSUSE
Installed Size : 70.9 KiB
Installed : No
Status : not installed
Source package : perl-Algorithm-Combinatorics-0.27-bp155.2.11.src
Upstream URL : http://search.cpan.org/dist/Algorithm-Combinatorics/
Summary : Efficient generation of combinatorial sequences
Description :
Algorithm::Combinatorics is an efficient generator of combinatorial
sequences. Algorithms are selected from the literature (work in progress,
see the /REFERENCES manpage). Iterators do not use recursion, nor stacks,
and are written in C.
Tuples are generated in lexicographic order, except in 'subsets()'.