subset_sum 0.13.1

Solves subset sum problem and returns a set of decomposed integers. It also can match corresponding numbers from two vectors and be used for Account reconciliation.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

[dependencies.pyo3]
features = ["extension-module"]
version = "0.15.1"

[dependencies.rand]
version = "0.8.5"

[lib]
crate-type = ["cdylib", "rlib"]
name = "dpss"

[package]
authors = ["Tomohiro Endo <europeanplaice@gmail.com>"]
categories = ["algorithms"]
description = "Solves subset sum problem and returns a set of decomposed integers. It also can match corresponding numbers from two vectors and be used for Account reconciliation."
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.13.1"
[profile.release]
lto = true