# Buildsheet autogenerated by ravenadm tool -- Do not edit.

NAMEBASE=		perl-Algorithm-Knapsack
VERSION=		0.02
KEYWORDS=		perl
VARIANTS=		536 538
SDESC[536]=		Brute-force solution of knapsack problem (5.36)
SDESC[538]=		Brute-force solution of knapsack problem (5.38)
HOMEPAGE=		none
CONTACT=		Perl_Automaton[perl@ironwolf.systems]

DOWNLOAD_GROUPS=	main
SITES[main]=		CPAN/ID:A/AN/ANDALE
DISTFILE[1]=		Algorithm-Knapsack-0.02.tar.gz:main
DF_INDEX=		1
SPKGS[536]=		single
SPKGS[538]=		single

OPTIONS_AVAILABLE=	PERL_536 PERL_538
OPTIONS_STANDARD=	none
VOPTS[536]=		PERL_536=ON PERL_538=OFF
VOPTS[538]=		PERL_536=OFF PERL_538=ON

DISTNAME=		Algorithm-Knapsack-0.02

GENERATED=		yes

SINGLE_JOB=		yes

[PERL_536].USES_ON=			perl:536,configure

[PERL_538].USES_ON=			perl:538,configure

[FILE:367:descriptions/desc.single]
The knapsack problem asks, given a set of items of various weights, find a
subset or subsets of items such that their total weight is no larger than
some given capacity but as large as possible. This module solves a special
case of the 0-1 knapsack problem when the value of each item is equal to
its weight. Capacity and weights are restricted to positive integers.


[FILE:109:distinfo]
0022f231eb3da1f28e18fcb1c92483a793ed8280db26cb241572ad9d4cdecb61         3587 Algorithm-Knapsack-0.02.tar.gz