| 1 |
Source: libalgorithm-munkres-perl |
| 2 |
Maintainer: Debian Perl Group <[email protected]> |
| 3 |
Uploaders: Charles Plessy <[email protected]>, |
| 4 |
Ansgar Burchardt <[email protected]> |
| 5 |
Section: perl |
| 6 |
Priority: optional |
| 7 |
Build-Depends: debhelper-compat (= 13) |
| 8 |
Build-Depends-Indep: perl |
| 9 |
Standards-Version: 3.9.6 |
| 10 |
Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libalgorithm-munkres-perl |
| 11 |
Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libalgorithm-munkres-perl.git |
| 12 |
Homepage: https://metacpan.org/release/Algorithm-Munkres |
| 13 |
Testsuite: autopkgtest-pkg-perl |
| 14 |
|
| 15 |
Package: libalgorithm-munkres-perl |
| 16 |
Architecture: all |
| 17 |
Depends: ${perl:Depends}, |
| 18 |
${misc:Depends} |
| 19 |
Multi-Arch: foreign |
| 20 |
Description: extension for Munkres' solution to Assignment problem |
| 21 |
The Algorithm::Munkres module extends the solution of Assignment problem |
| 22 |
for square matrices to rectangular matrices by padding zeros. Thus a |
| 23 |
rectangular matrix is converted to square matrix by padding necessary zeros. |
| 24 |
. |
| 25 |
Assignment Problem: Given N jobs, N workers and the time taken by |
| 26 |
each worker to complete a job then how should the assignment of a |
| 27 |
Worker to a Job be done, so as to minimize the time taken. |