subset_sum 0.5.1

Solves subset sum problem and return a set of decomposed integers.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

[[bench]]
harness = false
name = "my_benchmark"

[dependencies]
[dev-dependencies.criterion]
version = "0.3"

[package]
authors = ["Tomohiro Endo <europeanplaice@gmail.com>"]
categories = ["algorithms"]
description = "Solves subset sum problem and return a set of decomposed integers."
edition = "2018"
keywords = ["dynamic_programming", "subset_sum", "accounting"]
license = "MIT"
name = "subset_sum"
readme = "readme.md"
repository = "https://github.com/europeanplaice/subset_sum"
version = "0.5.1"