libalgorithm-munkres-perl 0.08-3 source package in Ubuntu

Changelog

libalgorithm-munkres-perl (0.08-3) unstable; urgency=low

  * Team upload

  [ Ansgar Burchardt ]
  * Update my email address.
  * debian/control: Convert Vcs-* fields to Git.

  [ gregor herrmann ]
  * debian/control: update {versioned,alternative} (build) dependencies.

  [ Salvatore Bonaccorso ]
  * Change Vcs-Git to canonical URI (git://anonscm.debian.org)
  * Change search.cpan.org based URIs to metacpan.org based URIs

  [ gregor herrmann ]
  * Strip trailing slash from metacpan URLs.

  [ Salvatore Bonaccorso ]
  * Update Vcs-Browser URL to cgit web frontend

  [ Damyan Ivanov ]
  * use source format '3.0 (quilt)'
  * mark package as autopkg-testable
  * Declare conformance with Policy 3.9.6

 -- Damyan Ivanov <email address hidden>  Sat, 21 Nov 2015 19:42:14 +0000

Upload details

Uploaded by:
Debian Perl Group on 2015-11-21
Uploaded to:
Sid
Original maintainer:
Debian Perl Group
Architectures:
all
Section:
perl
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Impish release on 2021-04-23 universe perl
Hirsute release on 2020-10-23 universe perl
Groovy release on 2020-04-24 universe perl
Focal release on 2019-10-18 universe perl
Bionic release on 2017-10-24 universe perl
Xenial release on 2015-11-22 universe perl

Builds

Xenial: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
libalgorithm-munkres-perl_0.08-3.dsc 2.1 KiB a6fe408cc1da3e4caf93a1c445e0f2faf16403fd566b122c8fa21e9f3d8fc58a
libalgorithm-munkres-perl_0.08.orig.tar.gz 8.4 KiB 196bcda3984b179cedd847a7c16666b4f9741c07f611a65490d9e7f4b7a55626
libalgorithm-munkres-perl_0.08-3.debian.tar.xz 2.4 KiB d1dd03c71fb62935e6ee633341b7b72197c9a6ae0de55c5bf22d39d386392136

Available diffs

No changes file available.

Binary packages built by this source

libalgorithm-munkres-perl: extension for Munkres' solution to Assignment problem

 The Algorithm::Munkres module extends the solution of Assignment problem
 for square matrices to rectangular matrices by padding zeros. Thus a
 rectangular matrix is converted to square matrix by padding necessary zeros.
 .
 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.