{"_id":"dijkstrajs","_rev":"2973337","name":"dijkstrajs","description":"A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.","dist-tags":{"latest":"1.0.3"},"maintainers":[{"name":"tcort","email":"linuxgeek@gmail.com"}],"time":{"modified":"2023-06-15T08:23:21.000Z","created":"2014-05-17T13:15:27.520Z","1.0.3":"2023-04-15T19:44:22.705Z","1.0.2":"2021-05-26T08:31:22.201Z","1.0.1":"2015-11-13T16:33:05.517Z","1.0.0":"2014-05-17T13:26:12.664Z","0.0.0":"2014-05-17T13:15:27.520Z"},"users":{},"repository":{"type":"git","url":"git://github.com/tcort/dijkstrajs.git"},"versions":{"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":{"shasum":"4c8dbdea1f0f6478bff94d9c49c784d623e4fc23","size":3541,"noattachment":false,"key":"/dijkstrajs/-/dijkstrajs-1.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/dijkstrajs/download/dijkstrajs-1.0.3.tgz"},"_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,"_cnpmcore_publish_time":"2023-04-15T19:44:22.705Z","publish_time":1681587862705,"_cnpm_publish_time":1681587862705},"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":{"shasum":"2e48c0d3b825462afe75ab4ad5e829c8ece36257","size":3576,"noattachment":false,"key":"/dijkstrajs/-/dijkstrajs-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/dijkstrajs/download/dijkstrajs-1.0.2.tgz"},"_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,"publish_time":1622017882201,"_cnpm_publish_time":1622017882201,"_cnpmcore_publish_time":"2021-12-16T10:06:14.050Z"},"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","size":3727,"noattachment":false,"key":"/dijkstrajs/-/dijkstrajs-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/dijkstrajs/download/dijkstrajs-1.0.1.tgz"},"directories":{},"publish_time":1447432385517,"_hasShrinkwrap":false,"_cnpm_publish_time":1447432385517,"_cnpmcore_publish_time":"2021-12-16T10:06:14.271Z"},"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","size":3114,"noattachment":false,"key":"/dijkstrajs/-/dijkstrajs-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/dijkstrajs/download/dijkstrajs-1.0.0.tgz"},"directories":{},"publish_time":1400333172664,"_hasShrinkwrap":false,"_cnpm_publish_time":1400333172664,"_cnpmcore_publish_time":"2021-12-16T10:06:14.470Z"},"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","size":2660,"noattachment":false,"key":"/dijkstrajs/-/dijkstrajs-0.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/dijkstrajs/download/dijkstrajs-0.0.0.tgz"},"directories":{},"publish_time":1400332527520,"_hasShrinkwrap":false,"_cnpm_publish_time":1400332527520,"_cnpmcore_publish_time":"2021-12-16T10:06:14.752Z"}},"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","_attachments":{},"homepage":"https://github.com/tcort/dijkstrajs","bugs":{"url":"https://github.com/tcort/dijkstrajs/issues"},"license":"MIT"}