devel:languages:perl

Perl and perl modules

++++++++++ Note: We are going to change the version format of the modules. See https://github.com/openSUSE/cpanspec/issues/47 for context ++++++++++ ++++++++++ Note 2: Packages are maintained under git as of 2025-08-13: https://src.opensuse.org/perl https://en.opensuse.org/openSUSE:OBS_to_Git ++++++++++ Perl and a large number of important perl modules and tools. Module updates from CPAN are regularly checked (with scripts from https://github.com/openSUSE/autoupdate-perl and https://github.com/openSUSE/cpanspec ) and put into https://build.opensuse.org/project/show/devel:languages:perl:autoupdate . Please check https://build.opensuse.org/project/show/devel:languages:perl:autoupdate first before doing your own update! An updated version of the module might already be there, just that there is no submit request yet. How to submit a new module here: https://github.com/openSUSE/cpanspec/wiki/Submit-a-new-Perl-module-to-openSUSE https://download.opensuse.org/repositories/devel:/languages:/perl/16.0/ openSUSE:Leap:16.0

openSUSE Leap 16.0 based on SLFO

Leap 16.0 based on SLES 16.0 (specifically SLFO:1.2) https://download.opensuse.org/distribution/leap/16.0/repo/oss/ openSUSE:Backports:SLE-16.0

Community packages for SLE-16.0

Community packages for SLE-16.0 https://download.opensuse.org/repositories/openSUSE:/Backports:/SLE-16.0/standard/ SUSE:SLFO:1.2

SLFO 1.2 (the base for openSUSE 16.0 and SLES 16.0)

https://download.opensuse.org/repositories/SUSE:/SLFO:/1.2/standard/ perl-Algorithm-Munkres

Munkres.pm

Assignment Problem: Given N jobs, N workers and the time taken by each worker to complete a job then how should the assignment of a Worker to a Job be done, so as to minimize the time taken. Thus if we have 3 jobs p,q,r and 3 workers x,y,z such that: x y z p 2 4 7 q 3 9 5 r 8 2 9 where the cell values of the above matrix give the time required for the worker(given by column name) to complete the job(given by the row name) then possible solutions are: Total 1. 2, 9, 9 20 2. 2, 2, 5 9 3. 3, 4, 9 16 4. 3, 2, 7 12 5. 8, 9, 7 24 6. 8, 4, 5 17 Thus (2) is the optimal solution for the above problem. This kind of brute-force approach of solving Assignment problem quickly becomes slow and bulky as N grows, because the number of possible solution are N! and thus the task is to evaluate each and then find the optimal solution.(If N=10, number of possible solutions: 3628800 !) Munkres' gives us a solution to this problem, which is implemented in this module. This module also solves Assignment problem for rectangular matrices (M x N) by converting them to square matrices by padding zeros. ex: If input matrix is: [2, 4, 7, 9], [3, 9, 5, 1], [8, 2, 9, 7] i.e 3 x 4 then we will convert it to 4 x 4 and the modified input matrix will be: [2, 4, 7, 9], [3, 9, 5, 1], [8, 2, 9, 7], [0, 0, 0, 0]