API/api.medcify.app/node_modules/dijkstrajs/package.json
2022-09-26 11:41:44 +05:30

86 lines
2.0 KiB
JSON

{
"_from": "dijkstrajs@^1.0.1",
"_id": "dijkstrajs@1.0.2",
"_inBundle": false,
"_integrity": "sha512-QV6PMaHTCNmKSeP6QoXhVTw9snc9VD8MulTT0Bd99Pacp4SS1cjcrYPgBPmibqKVtMJJfqC6XvOXgPMEEPH/fg==",
"_location": "/dijkstrajs",
"_phantomChildren": {},
"_requested": {
"type": "range",
"registry": true,
"raw": "dijkstrajs@^1.0.1",
"name": "dijkstrajs",
"escapedName": "dijkstrajs",
"rawSpec": "^1.0.1",
"saveSpec": null,
"fetchSpec": "^1.0.1"
},
"_requiredBy": [
"/qrcode"
],
"_resolved": "https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-1.0.2.tgz",
"_shasum": "2e48c0d3b825462afe75ab4ad5e829c8ece36257",
"_spec": "dijkstrajs@^1.0.1",
"_where": "/var/www/api.medcify.app/node_modules/qrcode",
"bugs": {
"url": "https://github.com/tcort/dijkstrajs/issues"
},
"bundleDependencies": false,
"deprecated": false,
"description": "A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.",
"devDependencies": {
"expect.js": "^0.3.1",
"jshint": "^2.12.0",
"mocha": "^8.4.0"
},
"homepage": "https://github.com/tcort/dijkstrajs",
"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
}
},
"keywords": [
"dijkstra",
"shortest",
"path",
"search",
"graph"
],
"license": "MIT",
"main": "dijkstra.js",
"name": "dijkstrajs",
"repository": {
"type": "git",
"url": "git://github.com/tcort/dijkstrajs.git"
},
"scripts": {
"pretest": "jshint dijkstra.js",
"test": "mocha -R spec"
},
"version": "1.0.2"
}