dijkstra-tree/package.json at master · assertis/dijkstra-tree · 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
{
  "name": "@assertis/dijkstra-tree",
  "version": "0.3.0",
  "description": "Implementation of Dijkstra's algorithm that returns a shortest path tree",
  "main": "./dist/src/index.js",
  "types": "./dist/src/index.d.ts",
  "scripts": {
    "test": "mocha --compilers ts:ts-node/register,tsx:ts-node/register 'test/**/*.spec.ts'",
    "prepublishOnly": "tsc -p ./ --outDir dist/"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/assertis/dijkstra-tree.git"
  },
  "keywords": [
    "dijkstra",
    "shortest",
    "path",
    "tree"
  ],
  "author": "Linus Norton",
  "license": "GPL-3.0",
  "bugs": {
    "url": "https://github.com/assertis/dijkstra-tree/issues"
  },
  "homepage": "https://github.com/assertis/dijkstra-tree#readme",
  "dependencies": {},
  "engines": {
    "node": "^9.0.0"
  },
  "devDependencies": {
    "@types/chai": "^4.1.2",
    "@types/mocha": "^2.2.47",
    "chai": "^4.1.2",
    "mocha": "^3.5.3",
    "ts-node": "^3.3.0",
    "typescript": "^2.6.2"
  }
}