{"_id":"dijkstrajs","_rev":"10-a85ade07c652cdef8bddb40292318b93","name":"dijkstrajs","description":"A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.","dist-tags":{"latest":"1.0.3"},"versions":{"0.0.0":{"name":"dijkstrajs","version":"0.0.0","description":"A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.","main":"dijkstra.js","scripts":{"test":"node tests.js"},"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","_id":"dijkstrajs@0.0.0","_shasum":"8c2df0682be524309379adc54dc54144f8b9fa32","_from":".","_npmVersion":"1.4.10","_npmUser":{"name":"tcort","email":"linuxgeek@gmail.com"},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"dist":{"shasum":"8c2df0682be524309379adc54dc54144f8b9fa32","tarball":"https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-0.0.0.tgz","integrity":"sha512-vEYnHAB4ApUAvakLHA115fi70r7AyrpDXlaEdMCfruBbAVRzi4nWUxVMv5mAvSzqBkr4eT4UGTkyFvkB03XdhQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFjsBl2QtwWF7io/v0zvVzCp24Vp5Z7fSh6r07bKO6s3AiAV6RYmr0TqpgFgWORREdnGbmdKrJ+7i39A0VhwZ4CwEw=="}]},"directories":{}},"1.0.0":{"name":"dijkstrajs","version":"1.0.0","description":"A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.","main":"dijkstra.js","scripts":{"test":"node tests.js"},"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","_id":"dijkstrajs@1.0.0","_shasum":"4447bbb15b97d4dada309c50aba62e4e9703c9a8","_from":".","_npmVersion":"1.4.10","_npmUser":{"name":"tcort","email":"linuxgeek@gmail.com"},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"dist":{"shasum":"4447bbb15b97d4dada309c50aba62e4e9703c9a8","tarball":"https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-1.0.0.tgz","integrity":"sha512-k2G3cG3QzYIlGt7dTeSCG+WOImp00n5mP9frger/8M4znS1oFKLRToCEIIm1D57eaLra7zEHw9uNXi+mYO2Wcw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDOinX1pDQmWLt18PwDcWFxUC0BS2EgImMvEqMhe/QjFgIhAIBQ8G9uSY3mYI3dJqPX4A0tEH7JhH26bwGs0qobSHHh"}]},"directories":{}},"1.0.1":{"name":"dijkstrajs","version":"1.0.1","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.git"},"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.8.0","mocha":"^2.3.3"},"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}},"gitHead":"d2aa747821720510bf8dde435fe3bb7bee5e0f34","_id":"dijkstrajs@1.0.1","_shasum":"d3cd81221e3ea40742cfcde556d4e99e98ddc71b","_from":".","_npmVersion":"2.13.1","_nodeVersion":"0.12.6","_npmUser":{"name":"tcort","email":"linuxgeek@gmail.com"},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"dist":{"shasum":"d3cd81221e3ea40742cfcde556d4e99e98ddc71b","tarball":"https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-1.0.1.tgz","integrity":"sha512-goNHV5cW23Dnwq2hgLhOmV/ACzI7VrGKIPLnuUPg+CYyx7dO3Y5VQGNU7VY90cCfhQxGhqSrnwJMN+wTgXq68g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBHx4cPbjQC41DnqXqgH2mHTenur7vIXO46KK56+ODhrAiEAiJvB2Dgc8X9076z04xLgEtqj70IKxShVShBFZKmXKp4="}]},"directories":{}},"1.0.2":{"name":"dijkstrajs","version":"1.0.2","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.git"},"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.12.0","mocha":"^8.4.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}},"gitHead":"b13c58e96c5250701ba3044411ec99b6ae85cc7f","_id":"dijkstrajs@1.0.2","_nodeVersion":"10.16.3","_npmVersion":"6.13.4","dist":{"integrity":"sha512-QV6PMaHTCNmKSeP6QoXhVTw9snc9VD8MulTT0Bd99Pacp4SS1cjcrYPgBPmibqKVtMJJfqC6XvOXgPMEEPH/fg==","shasum":"2e48c0d3b825462afe75ab4ad5e829c8ece36257","tarball":"https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-1.0.2.tgz","fileCount":7,"unpackedSize":10797,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJgrgdaCRA9TVsSAnZWagAA8q0P/0QCFcP9omCi+kOv+X49\nw5tUpCqnie8Ikj9yEpmEns+vmLidGOy4nv9jDttcnmOS08f/LWyMcd6K3tKA\nsVIDY/UF9K2B+bNipAl7W6NTjkr9Ln8YXAF4lMxhdvPa7pVtXGwgT2d3oGeK\nlC77oYwPaLOH8M16XnmaM0s59rEXgiPweGwXWJJD3dWFL/6wDFqKL6hhEWLv\nCxjxsK+gQgSi09OIU+MnAfSQmMf+MIicNekfsGmcPkHs6xUzHHWZ3f3NcN77\nJo8R/KkFix92yroqPX0LqkPIc4xJ4aGUqMIvcbmw/txGCvG5XAaY00IAOzFX\nMZhLq6ZBYnwEjitgMfBXT42cNMPzoskGvakTCF+xMhsa1TQEdT6DnxrUidmO\nrwU5nXuYaBnD3bXg0AG5Cq7aW6gC8LEJ7/cmxJjxRq7SuYWm5B+7h806JSyM\nq6r4WMTd404e9vSEwVK/rcSuB6ecEG0hkECr4kV1VlyzoDClUZ3ZTt869qdv\naycI8rReWWA3kDUxes+v0OtdoH5e5UjiTOQ5G+EsnK33yBUkIjngwKUsCgc0\n3VE9/Ri2TjiAspHiOTgGNtG27Nk2W396Rmdi/nn+jJFKXIJKJa1hMfaNY77q\noLccwbCYbIE1RsLfuSBBK5F+TV8wfI874hoevFq/WPh+Pv2ifyHwm5SR+8hI\nSBZj\r\n=GY5r\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICTx29NTHZT+sAJIOzzjJ21jdecIvHhxmZS2hyxtJAMcAiARoaQ5tdqn8d+QwgiHjP8XX8ZVc40kSbb97o1NGWNwUA=="}]},"_npmUser":{"name":"tcort","email":"linuxgeek@gmail.com"},"directories":{},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/dijkstrajs_1.0.2_1622017882034_0.6943478582244718"},"_hasShrinkwrap":false},"1.0.3":{"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.git"},"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}},"gitHead":"49ad1ecd5c519281ee3c4711bb78db4d96e19c83","_id":"dijkstrajs@1.0.3","_nodeVersion":"16.15.1","_npmVersion":"8.11.0","dist":{"integrity":"sha512-qiSlmBq9+BCdCA/L46dw8Uy93mloxsPSbwnm5yrKn2vMPiy8KyAskTF6zuV/j5BMsmOGZDPs7KjU+mjb670kfA==","shasum":"4c8dbdea1f0f6478bff94d9c49c784d623e4fc23","tarball":"https://registry.npmjs.org/dijkstrajs/-/dijkstrajs-1.0.3.tgz","fileCount":7,"unpackedSize":10798,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEQ1cYV25t4H0cv7awRaKpQHF/6no2s0WMUCEV6R9OZqAiAwajbHk+8rDv8muKVzyFrQoldjZLuSlwSdQfJPCokOmQ=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJkOv6WACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmrCFw/+JCl4Yb9z7GAz4l5En4h4N+hKdneUgmIyyAPLHqv5JDFEORER\r\nMEMEyrTRPRQ6hLwLiECSs1Hu65LRovmuYcP/m6L1hSjkI2OKCEEE8B5cwifp\r\nGlXeK4kf84GjYDERLMpw2cKzp4IALGoG3l+vBd8IZJyWkBkvGK40qmk/I/ct\r\n7FwPkroYEgqKCKyu1ZgRarWsH3b6orNNEwTznsQPQDsN2sUDP0eE1gsafvKb\r\nsEQPRW88Oi1Grgci4SeqdJp1yPT2h2zh1y/fwTERTqZspY4VoV2QkazEnrDc\r\nidqKExiKWyHPCnpVHSUTmYiXU8msrEWMNr/ikWq3WtTb5iijeMnZDjNiCKp6\r\nh/hxybi8RCF7++I9EsqMCoEyTYIAeYSGdFHSOtQsIezLb8jjAflM7K3cwm2e\r\n5mG/7oPL6dO8/aXb9GzKibBQHn0hQyKpYiB1YMw4xTgHrZpiOwkkobplPm1N\r\nWcVfSyn9CGzuACA/GVrP0EntKOI9LDSdziXyemISM9GaUj9F0kUA99fChpwO\r\nsi9Nraut7ztlNXzbgVucPqqOHmwl8Ys9APXiBSuEjRd730D9D1JoJ/2+Lmkz\r\nRLATEXE6OX0r57kryDuqzK6u4w2ZGQOPajqb3bfVbylUxS/HjVXjzZKkoGz+\r\nG+S6eMspm8+0gHj2wSvA4O0Yc4Hi81g9RSY=\r\n=s9rG\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"tcort","email":"linuxgeek@gmail.com"},"directories":{},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/dijkstrajs_1.0.3_1681587862549_0.8163995483782189"},"_hasShrinkwrap":false}},"readme":"# dijkstrajs.js\n\ndijkstrajs is a simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.\n\nThe code was originally written by Wyatt Baldwin and turned into a node module by Thomas Cort.\n\n## Requirements\n\n* [nodejs](http://nodejs.org/)\n\n## Installation\n\n    npm install dijkstrajs\n\n## Examples\n\nSee `test/dijkstra.test.js` in the sources for some example code.\n\n","maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"time":{"modified":"2023-04-15T19:44:22.831Z","created":"2014-05-17T13:15:27.520Z","0.0.0":"2014-05-17T13:15:27.520Z","1.0.0":"2014-05-17T13:26:12.664Z","1.0.1":"2015-11-13T16:33:05.517Z","1.0.2":"2021-05-26T08:31:22.201Z","1.0.3":"2023-04-15T19:44:22.705Z"},"homepage":"https://github.com/tcort/dijkstrajs","keywords":["dijkstra","shortest","path","search","graph"],"repository":{"type":"git","url":"git://github.com/tcort/dijkstrajs.git"},"bugs":{"url":"https://github.com/tcort/dijkstrajs/issues"},"license":"MIT","readmeFilename":"README.md"}