{"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","dist-tags":{"latest":"1.0.3"}}