bucket_9F/perl-Algorithm-Knapsack

   1 # Buildsheet autogenerated by ravenadm tool -- Do not edit.
   2
   3 NAMEBASE=               perl-Algorithm-Knapsack
   4 VERSION=                0.02
   5 KEYWORDS=               perl
   6 VARIANTS=               528 526
   7 SDESC[526]=             Brute-force solution of knapsack problem (v526)
   8 SDESC[528]=             Brute-force solution of knapsack problem (v528)
   9 HOMEPAGE=               none
  10 CONTACT=                Perl_Automaton[perl@ironwolf.systems]
  11
  12 DOWNLOAD_GROUPS=        main
  13 SITES[main]=            CPAN/ID:A/AN/ANDALE
  14 DISTFILE[1]=            Algorithm-Knapsack-0.02.tar.gz:main
  15 DF_INDEX=               1
  16 SPKGS[526]=             single
  17 SPKGS[528]=             single
  18
  19 OPTIONS_AVAILABLE=      PERL_528 PERL_526
  20 OPTIONS_STANDARD=       none
  21 VOPTS[526]=             PERL_528=OFF PERL_526=ON
  22 VOPTS[528]=             PERL_528=ON PERL_526=OFF
  23
  24 DISTNAME=               Algorithm-Knapsack-0.02
  25
  26 GENERATED=              yes
  27
  28 SINGLE_JOB=             yes
  29
  30 [PERL_526].USES_ON=                     perl:526,configure
  31
  32 [PERL_528].USES_ON=                     perl:528,configure
  33
  34 [FILE:367:descriptions/desc.single]
  35 The knapsack problem asks, given a set of items of various weights, find a
  36 subset or subsets of items such that their total weight is no larger than
  37 some given capacity but as large as possible. This module solves a special
  38 case of the 0-1 knapsack problem when the value of each item is equal to
  39 its weight. Capacity and weights are restricted to positive integers.
  40
  41
  42 [FILE:109:distinfo]
  43 0022f231eb3da1f28e18fcb1c92483a793ed8280db26cb241572ad9d4cdecb61         3587 Algorithm-Knapsack-0.02.tar.gz
  44