ae61e1b768
This module provides both a C and pure ruby simple subset sum problem solver. The subset sum problem is, given a set of numbers, can the sum of any subset of those numbers equal a given number. This problem is NP-complete. Both the C and pure ruby versions implement a fairly simple meet-in-the-middle algorithm. The C version uses an AVL tree to store the data, while the pure ruby version uses a ruby hash. For the C version to be used, the sum of the positive numbers and the sum of the negative numbers in the set, as well as the wanted number, must all be Fixnums. Additionally, max_seconds should be nil or a Fixnum.
25 lines
519 B
Makefile
25 lines
519 B
Makefile
# $OpenBSD: Makefile,v 1.1.1.1 2010/12/20 18:09:01 jeremy Exp $
|
|
|
|
COMMENT = simple subset sum problem solver for ruby
|
|
|
|
DISTNAME = subset_sum-1.0.1
|
|
CATEGORIES = devel
|
|
|
|
HOMEPAGE= http://subset-sum.rubyforge.org/
|
|
|
|
MAINTAINER = Jeremy Evans <jeremy@openbsd.org>
|
|
|
|
# MIT License
|
|
PERMIT_PACKAGE_CDROM = Yes
|
|
PERMIT_PACKAGE_FTP = Yes
|
|
PERMIT_DISTFILES_CDROM = Yes
|
|
PERMIT_DISTFILES_FTP = Yes
|
|
|
|
MODULES = lang/ruby
|
|
|
|
CONFIGURE_STYLE = ruby gem ext
|
|
MODRUBY_REGRESS = rspec
|
|
RSPEC_REGRESS_TARGET = spec/*_spec.rb
|
|
|
|
.include <bsd.port.mk>
|