subset-sum-solver/package.json at master · chaperise/subset-sum-solver · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
{
  "name": "@armirage/subset-sum-solver",
  "version": "1.0.3",
  "description": "The Fastest and Smallest Subset finder. Finds all subsets from an array that equal a target number. In  O(N log N) time and 2N+2 Space.",
  "keywords": [
    "armirage",
    "subset sum problem",
    "subset",
    "ssp",
    "traveling sales man",
    "knapsack"
  ],
  "homepage": "https://github.com/armirage/subset-sum-solver#readme",
  "author": {
    "name": "Clint Mulligan",
    "email": "clint.mulligan@armirage.com",
    "url": "https://armirage.github.io/"
  },
  "license": "BSD-3-Clause",
  "funding": [
    {
      "type": "Liberapay",
      "url": "https://en.liberapay.com/armirage"
    },
    {
      "type": "PayPal",
      "url": "https://www.paypal.com/paypalme/armirage"
    }
  ],
  "repository": {
    "type": "git",
    "url": "git+https://github.com/armirage/subset-sum-solver.git"
  },
  "bugs": {
    "url": "https://github.com/armirage/subset-sum-solver/issues"
  },
  "browser": "index.html",
  "scripts": {
    "patch:better-docs": "mv ./node_modules/better-docs/bundler.js ./node_modules/better-docs/bundler.js.bak && cp ./docs/doc-settings/better-docs/bundler.js ./node_modules/better-docs",
    "build:release": "grunt && cp LICENSE.md release && cp README.md release && cp package.json release",
    "test": "echo \"Error: no test specified\" && exit 1"
  },
  "dependencies": {},
  "peerDependencies": {},
  "devDependencies": {
    "@armirage/eslint-config-armirage": "^1.0.3",
    "@armirage/grunt-remove-js-comments": "^3.0.2",
    "better-docs": "^2.3.2",
    "eslint": "^7.10.0",
    "grunt": "^1.3.0",
    "grunt-contrib-clean": "^2.0.0",
    "grunt-docco-plus": "^3.0.0",
    "grunt-eslint": "^23.0.0",
    "grunt-jsdoc": "^2.4.1",
    "jsdoc-mermaid": "^1.0.0"
  }
}