ruby33-subset_sum-1.0.2p0 – simple subset sum problem solver for ruby (cvsweb github mirror)

Description

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.

WWW: http://ruby-subsetsum.jeremyevans.net/

Maintainer

Jeremy Evans

Only for arches

aarch64 alpha amd64 arm hppa i386 mips64 mips64el powerpc powerpc64 riscv64 sparc64

Categories

devel lang/ruby

Library dependencies

Build dependencies

Run dependencies

Test dependencies

Reverse dependencies

Files

Ports Readmes 7.52, created on 2024-12-18, powered by Dancer 1.3521