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