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
58
59
60
| {
| "name": "dijkstrajs",
| "version": "1.0.3",
| "description": "A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.",
| "main": "dijkstra.js",
| "scripts": {
| "pretest": "jshint dijkstra.js",
| "test": "mocha -R spec"
| },
| "repository": {
| "type": "git",
| "url": "git://github.com/tcort/dijkstrajs"
| },
| "keywords": [
| "dijkstra",
| "shortest",
| "path",
| "search",
| "graph"
| ],
| "license": "MIT",
| "bugs": {
| "url": "https://github.com/tcort/dijkstrajs/issues"
| },
| "homepage": "https://github.com/tcort/dijkstrajs",
| "devDependencies": {
| "expect.js": "^0.3.1",
| "jshint": "^2.13.6",
| "mocha": "^10.2.0"
| },
| "jshintConfig": {
| "bitwise": true,
| "curly": true,
| "eqeqeq": true,
| "forin": true,
| "freeze": true,
| "globalstrict": true,
| "immed": true,
| "indent": 4,
| "moz": true,
| "newcap": true,
| "noarg": true,
| "node": true,
| "noempty": true,
| "nonew": true,
| "trailing": true,
| "undef": true,
| "smarttabs": true,
| "strict": true,
| "validthis": true,
| "globals": {
| "describe": false,
| "it": false,
| "before": false,
| "beforeEach": false,
| "after": false,
| "afterEach": false
| }
| }
| }
|
|
