Rename the project name.

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "subset_sum"
-version = "0.10.0"
+version = "0.10.1"
 edition = "2018"
 authors = ["Tomohiro Endo <europeanplaice@gmail.com>"]
 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." 
@@ -19,7 +19,7 @@ rand = "0.8.5"
 criterion = "0.3"
 
 [lib]
-name = "subset_sum_py"
+name = "dpss"
 crate-type = ["cdylib"]
 
 [dependencies.pyo3]

pyproject.toml

@@ -0,0 +1,6 @@
+[project]
+name = "dpss"
+
+[build-system]
+requires = ["maturin>=0.12,<0.13"]
+build-backend = "maturin"

readme.md

@@ -1,6 +1,8 @@
-# Subset Sum
+# Subset Sum(dpss)
 
-This is a Rust implementation that calculates subset sum problem. It 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.
+This is a Rust implementation that calculates subset sum problem using dynamic programming. It 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.
+
+`dpss` is short for `dynamic programming subset sum`.
 
 ## Installation
 Binary files are provided on the [Releases](https://github.com/europeanplaice/subset_sum/releases) page. When you download one of these, please add it to your PATH manually.
@@ -103,15 +105,15 @@ There are a lot of combinations!
 ## Use in Python
 ### installation
 ```
-pip install subset_sum
+pip install dpss
 ```
 ### Usage
 ```python
-import subset_sum_py
-print(subset_sum_py.find_subset([1, 2, 3], 2))
-print(subset_sum_py.find_subset_fast_only_positive([1, 2, 3], 2))
-print(subset_sum_py.sequence_matcher([1, 2, 3], [1, 2, 3]))
-print(subset_sum_py.sequence_matcher_m2m([1, 2, 3], [1, 2, 3]))
+import dpss
+print(dpss.find_subset([1, 2, 3], 2))
+print(dpss.find_subset_fast_only_positive([1, 2, 3], 2))
+print(dpss.sequence_matcher([1, 2, 3], [1, 2, 3]))
+print(dpss.sequence_matcher_m2m([1, 2, 3], [1, 2, 3]))
 ```
 
 ## Use in Rust

src/py_module.rs

@@ -25,7 +25,7 @@ fn sequence_matcher_m2m(mut key: Vec<i32>, mut targets: Vec<i32>) -> PyResult<Ve
 }
 
 #[pymodule]
-fn subset_sum_py(_py: Python, m: &PyModule) -> PyResult<()> {
+fn dpss(_py: Python, m: &PyModule) -> PyResult<()> {
     m.add_function(wrap_pyfunction!(find_subset, m)?)?;
     m.add_function(wrap_pyfunction!(sequence_matcher, m)?)?;
     m.add_function(wrap_pyfunction!(sequence_matcher_m2m, m)?)?;