{"_id":"@tyriar/fibonacci-heap","_rev":"25-4a5461582186dbf0cb464ba67b6713bb","name":"@tyriar/fibonacci-heap","description":"An implementation of the Fibonacci heap data structure","dist-tags":{"latest":"2.0.9","beta":"2.0.9-beta1"},"versions":{"0.1.0":{"name":"@tyriar/fibonacci-heap","version":"0.1.0","description":"An implementation of the Fibonacci heap data structure","scripts":{"test":"xo && ava"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"^0.4.2","xo":"^0.10.1"},"xo":{"space":true},"gitHead":"036b7734612834e51c94e09e4d70409cade732b3","_id":"@tyriar/fibonacci-heap@0.1.0","_shasum":"b0e9a6ffdd7384392a11fd41e16dabf1c6d0dd4c","_from":".","_npmVersion":"2.11.3","_nodeVersion":"0.12.7","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"b0e9a6ffdd7384392a11fd41e16dabf1c6d0dd4c","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-0.1.0.tgz","integrity":"sha512-1hZJl2ffRDcfBchvUpoH1cUi+7SJrTa8MZoWjPjaA4E6RTWYHqOZuCsmh73zQzU62C1JhU5taYl+BdkUXRcUwQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBS55AUq9juPM5+t9H1dZiw5DW/NNPVClLXskLvAvu6LAiEAp3RrqrFZiRiBN+ltfrOB8sXrgEs8nou4P2GHIx6kk6E="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.0":{"name":"@tyriar/fibonacci-heap","version":"1.0.0","description":"An implementation of the Fibonacci heap data structure","scripts":{"test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"*","coveralls":"^2.11.4","nyc":"^3.2.2","xo":"*"},"xo":{"space":true},"gitHead":"46ee4b56303cbdcb988fbdd0a119f0e364b2bbe5","_id":"@tyriar/fibonacci-heap@1.0.0","_shasum":"261e45959642a52d5e13c91d62a6140b937974a5","_from":".","_npmVersion":"2.11.3","_nodeVersion":"0.12.7","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"261e45959642a52d5e13c91d62a6140b937974a5","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.0.tgz","integrity":"sha512-F+H7c0ka6FuFUSyDruEV4s5IN2VFa9g7rblPdZCdhGYFCrliRHvv/N6IMQe3iYOdhP9MPMqHMgVs6WFbYHEwDA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIH2FwS+NtBDwBd6Eg/IiMB2DdZ6ksJ9D4p9l5CR6zSN9AiBUC5ePzko5jhslftb/tFFgwmuXrxHx4Mbpz1yQy3DXoQ=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.1":{"name":"@tyriar/fibonacci-heap","version":"1.0.1","description":"An implementation of the Fibonacci heap data structure","scripts":{"test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"*","coveralls":"^2.11.4","nyc":"^3.2.2","xo":"*"},"xo":{"space":true},"gitHead":"55e38309cc703df736480005f2fb377ff0d39357","_id":"@tyriar/fibonacci-heap@1.0.1","_shasum":"127597741ec1498e65c230d392e25b6d13042e2b","_from":".","_npmVersion":"2.11.3","_nodeVersion":"0.12.7","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"127597741ec1498e65c230d392e25b6d13042e2b","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.1.tgz","integrity":"sha512-XDY3XRqAVP0sgvVZOa1mMFa5vsFORfAnF/NcHPEiKv6qaZWoTyn3a215672cCgyVQQNxasfvct+9gUFj6Ugkzw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD9GzznBJ2GDh1USMMYUGSzCoslBB2QvAtuyl42YUsMyAIhAPH80zHY/U2tkx8W8Il4wjGZZmOKnocJQhlMB3kkgY7R"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.2":{"name":"@tyriar/fibonacci-heap","version":"1.0.2","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo --space 2 && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"*","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"*"},"gitHead":"ad27219c663afdf5e55ecd38ecc0923e7269c98f","_id":"@tyriar/fibonacci-heap@1.0.2","_shasum":"b358f4af545e6e209713ce2b2be2858e97fc5ce5","_from":".","_npmVersion":"3.3.6","_nodeVersion":"5.0.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"b358f4af545e6e209713ce2b2be2858e97fc5ce5","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.2.tgz","integrity":"sha512-gfF8aB29kNg1Q9mtNapf+6ZSS3FvuzPbam1ToSzISVNubd9rJN9NchMX+PKv8n0uRCkBvM/XOR3MEB9wkbhiig==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCID4po2KszJ/7zlLBBwiqQ/hbmEXhOMg1t1yWnSR2QcEeAiAPuE36rU592Qs+F0ytq2uWZRNAk+wc/gKag1WGflz+rA=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.3":{"name":"@tyriar/fibonacci-heap","version":"1.0.3","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo --space 2 && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"*","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"*"},"gitHead":"4d34f299f4d324cca29015a48e08baf278279cc9","_id":"@tyriar/fibonacci-heap@1.0.3","_shasum":"74b47137c1f2a4c545cc567aeb4771eb18e25be3","_from":".","_npmVersion":"3.3.6","_nodeVersion":"5.0.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"74b47137c1f2a4c545cc567aeb4771eb18e25be3","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.3.tgz","integrity":"sha512-K3qKw6b8Hf5AWE9tjkdYKTbkXlb0LUJxFc77Lpt9JzdNVdSt4DShhO7Y3fZQRZZGN/mZZMqBVGrLVafHmTDtSg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBkbmKDmbawIjVbvvHjT9UmbVgyOArLZKPwLgnc7yE0hAiBm7dXg4c5HoTOSsZeipsNgB6OezdJycyXROTae78QCFw=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.5":{"name":"@tyriar/fibonacci-heap","version":"1.0.5","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo --space 2 && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/Tyriar/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/Tyriar/js-fibonacci-heap/issues"},"homepage":"https://github.com/Tyriar/js-fibonacci-heap","devDependencies":{"ava":"*","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"*"},"gitHead":"8cb01aa25243d3ec2a3515cfd8d1e758f9a796c5","_id":"@tyriar/fibonacci-heap@1.0.5","_shasum":"6f4b8fde71b026bc5ea20308c6ed79d8ebf10eaa","_from":".","_npmVersion":"3.3.6","_nodeVersion":"5.0.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"6f4b8fde71b026bc5ea20308c6ed79d8ebf10eaa","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.5.tgz","integrity":"sha512-OqxcnKTjcIAzKvD9o8V2sU4Ow/u/gOV+xyKu5O7ecb6Oyh6PuMbsfBENnYArmX0/HJYsZmv89+a9vUEv3nGS0Q==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEnYHu8rFvR4nTirqkqkn7+vLo2wL6T18fGpToxfRoZkAiEAn28UE9j3CqE0JBbRjYvS63/VPhoD/NwcagAHLqKm/BU="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{}},"1.0.6":{"name":"@tyriar/fibonacci-heap","version":"1.0.6","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/GrowingWithTheWeb/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/GrowingWithTheWeb/js-fibonacci-heap/issues"},"homepage":"https://github.com/GrowingWithTheWeb/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.14.0","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"^0.15.0"},"xo":{"space":2},"gitHead":"24fe2ba0cc1a95471ed654b55fa3c86f52cdc28f","_id":"@tyriar/fibonacci-heap@1.0.6","_shasum":"33521810f1a2edf3f12e6dcb7ff23b68b90f8961","_from":".","_npmVersion":"3.8.5","_nodeVersion":"5.10.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"33521810f1a2edf3f12e6dcb7ff23b68b90f8961","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.6.tgz","integrity":"sha512-hcJLNE89pkpYumbpkbmC9ylZ05h8nuzaK3sK+SXqnNzQg8vAYf4DebqMykZz+6Rg+CzSJn7ItZr/RaD3pINfrw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEJZ9mw2rXM67JflMnOjdPLwfaIQpJJw459ekp0/uERjAiAbUd9d7o/KTk4X5jTtGeDROB9cmPHZuWrpqEfpy+YCXA=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/fibonacci-heap-1.0.6.tgz_1464319492976_0.3145492747426033"},"directories":{}},"1.0.7":{"name":"@tyriar/fibonacci-heap","version":"1.0.7","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/js-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.14.0","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"^0.15.0"},"xo":{"space":2},"gitHead":"c50cb33b1ab8e159bb0c07e1f48f87b1ce33bcc0","_id":"@tyriar/fibonacci-heap@1.0.7","_shasum":"915794269940b5e8b2564fe78100c389b5885bc5","_from":".","_npmVersion":"3.8.5","_nodeVersion":"5.10.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"915794269940b5e8b2564fe78100c389b5885bc5","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.7.tgz","integrity":"sha512-Mg+5O8LvUOPZx10FSCSobdmVMZ4uDALRiO97K2kOetVM8hPci+rvzOZGZQ+w4ajFq0b2+4UvC08Yus7A+ZAOGg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCEnmww7syrfqg4TSIGdCF+PxlkylA5/Gl7nige6t5aAAIgDvcE5R09QgbBQsOfc4eTDFTc3k8ZphnpgilDyis3FKk="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"packages-16-east.internal.npmjs.com","tmp":"tmp/fibonacci-heap-1.0.7.tgz_1464406123482_0.050996370147913694"},"directories":{}},"1.0.8":{"name":"@tyriar/fibonacci-heap","version":"1.0.8","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/js-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.14.0","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"^0.15.0"},"xo":{"space":2},"gitHead":"7468d7d3f28065170ddfffc9f4251c25720efa2d","_id":"@tyriar/fibonacci-heap@1.0.8","_shasum":"f4d3e2e1f4659b0f8d1f993a79976c241489027e","_from":".","_npmVersion":"3.8.5","_nodeVersion":"6.8.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"f4d3e2e1f4659b0f8d1f993a79976c241489027e","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.8.tgz","integrity":"sha512-IVbQae6boNB2E9ThiXNMatbgGS1XTBrwdyOt7Wnw5vXqzcKbub556sV90iUGSP9qz3MLshgSd2nbltrkV3wWCA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICDUSM8I5RgnJxKTAAYKlZG3Mpvr0yCMhg4PdxCo0e6+AiBQcRPGKo5rDijRgYIM3WWF9NfggY+F75uZFWAphUrPmw=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/fibonacci-heap-1.0.8.tgz_1476592269221_0.560624414589256"},"directories":{}},"1.0.9":{"name":"@tyriar/fibonacci-heap","version":"1.0.9","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/js-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.14.0","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"^0.15.0"},"xo":{"space":2},"gitHead":"9e19da259e30b6fc8b273172ae5fb0239e183ed0","_id":"@tyriar/fibonacci-heap@1.0.9","_shasum":"4863676b747fcab0c8eaf9822dd9fd77938a1bb2","_from":".","_npmVersion":"3.10.8","_nodeVersion":"6.9.1","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"4863676b747fcab0c8eaf9822dd9fd77938a1bb2","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.9.tgz","integrity":"sha512-7iyyoKoDu4Z9tZAd63maC7HD+ZOD3G9Vkc8jey4v8trwFJCLkCBkqgnz2dhVknCunmvoUGARGDXIsOkrxTO8EA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDlc3M62I9qufDtWMt+ShzAaDYRJmgUOWlqRC6/sSotVAIhAIlwIXT9GK8liIy1HCYMu/0MSWrnlF0m76BarfOvrmR6"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/fibonacci-heap-1.0.9.tgz_1478379903656_0.6323829970788211"},"directories":{}},"1.0.10":{"name":"@tyriar/fibonacci-heap","version":"1.0.10","description":"An implementation of the Fibonacci heap data structure","scripts":{"doc":"documentation-readme -s \"API\"","test":"xo && nyc ava","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"index.js","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/js-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.14.0","coveralls":"^2.11.4","documentation-readme":"^2.1.0","nyc":"^3.2.2","xo":"^0.15.0"},"xo":{"space":2},"gitHead":"ec31d0966f9e54b0a52f3a074fe1d2442ab69979","_id":"@tyriar/fibonacci-heap@1.0.10","_shasum":"0f88549387b3e94d9360c4446f6ccc2b4cfe74a8","_from":".","_npmVersion":"3.8.5","_nodeVersion":"6.8.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"0f88549387b3e94d9360c4446f6ccc2b4cfe74a8","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-1.0.10.tgz","integrity":"sha512-Twm0qFoVCunZKYB9hIf5ZG3LfMYa17rFzNz9OVZFuja7FWKFfCCAHLMRCymF/mFwn2RyKfEcnD9TPQFT24mJgw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDF5/VMp99by9gDnVqcsnzvxwzbq62VUFHdnh3CuZhDngIgTRG/QFtGO+Y+IUoSsB8SLhRtU8/Ayt7fBrvvwibCjno="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/fibonacci-heap-1.0.10.tgz_1479675427871_0.2921039720531553"},"directories":{}},"2.0.0":{"name":"@tyriar/fibonacci-heap","version":"2.0.0","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/js-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/js-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/js-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"gitHead":"d783ef2b12841bbad374bcf72d445e41a459dd6c","_id":"@tyriar/fibonacci-heap@2.0.0","_shasum":"a45e89eb193b36304a60192c01205cd8de8188f6","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.9.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"a45e89eb193b36304a60192c01205cd8de8188f6","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.0.tgz","integrity":"sha512-PkZUvWO/rZoU33zb2mRQHSLtRWQnFR0ZE/QZa7fixfMkie0R1VGislLTVuMtQNQSoRTr55dLudTNM1Z/19wXKQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIG/XTK4dn77w3k7zi3+MIs3539elSWB0j4llXjm14Z8WAiAarratMJAM546bJmXjeyvXHGVvD5lebsqlI71kkPK01w=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.0.tgz_1514829159670_0.1827857217285782"},"directories":{}},"2.0.1":{"name":"@tyriar/fibonacci-heap","version":"2.0.1","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"gitHead":"328aca1c562b20c0eee68ce550553629ce038218","_id":"@tyriar/fibonacci-heap@2.0.1","_shasum":"3622b8f8abb502e050102782cfbb5adc00de8ab1","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.9.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"3622b8f8abb502e050102782cfbb5adc00de8ab1","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.1.tgz","integrity":"sha512-AatlTf22WxV7Fn0oH0ZCihmsrM3FfCsvzs9F5a+uDnKB91ZAE6WQ+WAboQoElZBwx7pmNrvhqHxKBj5fN22fsQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFttkKPgozYcpN44kTTA7LEX8smSPHTMcr5E98kaHmX2AiBXf5S+i0KXQeFkxF86VRE/Pbay+pBltgTStNl3r01rvQ=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.1.tgz_1514829233260_0.7913768258877099"},"directories":{}},"2.0.2":{"name":"@tyriar/fibonacci-heap","version":"2.0.2","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map"],"gitHead":"d7ddc66fecee426338ae89f28f407a53e3df120b","_id":"@tyriar/fibonacci-heap@2.0.2","_shasum":"5a03ac04eabf0368ab94f18906f37406c9e0e8c2","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.9.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"5a03ac04eabf0368ab94f18906f37406c9e0e8c2","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.2.tgz","integrity":"sha512-Zrupm1F6mJf6HX3Jl8ThVYRoYH+ajIzgBuSWsTHGIEZIoc8LMQcr2EE+kHo1kctP9vxa8N4d+tsMBeZU94eevA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCTy+E+0vi78A9jab0yqpBUPf7VYauHZJEZ2jE1orpO/AIhAORhiBLlY/aSJNpXFWcTER53bO+7akRc27en4/zroI1H"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.2.tgz_1514829535248_0.7213489080313593"},"directories":{}},"2.0.3":{"name":"@tyriar/fibonacci-heap","version":"2.0.3","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map","src/*.js","src/**/*.js","typings/*.d.ts"],"gitHead":"320283733e2e968cdde8a6e7d5aea704e6cf19a8","_id":"@tyriar/fibonacci-heap@2.0.3","_shasum":"71c9cbad9c646c4bd298599932eea9d2a068820f","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.9.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"71c9cbad9c646c4bd298599932eea9d2a068820f","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.3.tgz","integrity":"sha512-RlGf9W8ok9gGTijMR6Co0vx4Cf6B3xYBipRDc7OsW9OCsu4QnXtsiI0pL4dMeGbYFL0u4Qsi5LfCdchhtSm3sQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDZxeK2CzFYDkYwfya+dcB6MAoolSFnSQNYxEbXnX7WNAIhAMx3KNBdPud7tK41zNSJVm2HUqdKGckCf8mH8viiUMdE"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.3.tgz_1514831364551_0.8926423843950033"},"directories":{}},"2.0.4":{"name":"@tyriar/fibonacci-heap","version":"2.0.4","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map","src/*.js","src/**/*.js","typings/*.d.ts"],"gitHead":"54330aa57961b61980cd3ff52a508171d30a3e8b","_id":"@tyriar/fibonacci-heap@2.0.4","_shasum":"49af4b36586637132ec8d2ddd1af8402d748b804","_from":".","_npmVersion":"4.2.0","_nodeVersion":"7.9.0","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"shasum":"49af4b36586637132ec8d2ddd1af8402d748b804","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.4.tgz","integrity":"sha512-3yuyyP3ujJKu/NAcPL2Fjaiel4sBUjEOXCtYCJd7w5nYC46BAzCcSvwXVEaLTx1cFZmgOtuEfb834RkluB5pYQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCX6pkd5IzSdPsuU+Ha5cnxyHXY+tMuz8q3H3EvknX2BgIhANu/k5WISxVxqM8Wfoa4nQcqn1FJ9hLl97l3IitGkFB6"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.4.tgz_1514844948276_0.8608541742432863"},"directories":{}},"2.0.5":{"name":"@tyriar/fibonacci-heap","version":"2.0.5","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map","src/*.js","src/**/*.js","typings/*.d.ts"],"gitHead":"6064c34514b05879575ec323d2566c3286f3bc17","_id":"@tyriar/fibonacci-heap@2.0.5","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-uOKkvk7ZR19OUd7t7tMr3wUHFBD6lyU0+c7t3cFIfBsE7GdAV0v9GFrDpSqrZg5i5GeTK4z4TS2QGVYlCrboFw==","shasum":"e7dcd8951129d4eda19fbd9a761166f65a55bee3","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.5.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCbH8Bf1xFf8IFhWwUcE59v9o+AcmE5msleKeK1YRa6UQIgTD916mZ0uiztjG1Yv/jyi6qoofq5x7pdi7UI5j2qp98="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.5.tgz_1516580302829_0.502990007167682"},"directories":{}},"2.0.6":{"name":"@tyriar/fibonacci-heap","version":"2.0.6","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map","src/*.ts","src/**/*.ts","typings/*.d.ts"],"gitHead":"8f7b7f5e8847333dcd0043e406ba1468bdde501b","_id":"@tyriar/fibonacci-heap@2.0.6","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-WPtauqZbTdYCOO0bKRbRiEujqfpv9Bect/QN8gFKetIYu3ctJR2NzIrcRwOu69Om8tRAIAHFF6OkWWC4PiRNmA==","shasum":"b886c008f431e5ef2eac8de51724dd4d6a383f61","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.6.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIFmsGkPe/2uVTnA6E72YLiEjWmDGeu/qumwM85zSO4JkAiBEqu1VqdVr6gt4WAc6qjvQidpfpdk0AhMxQG45nqmVjA=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.6.tgz_1516583647660_0.554312463151291"},"directories":{}},"2.0.7":{"name":"@tyriar/fibonacci-heap","version":"2.0.7","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint src/**/*.ts","test":"nyc ava","watch":"tsc -w","coveralls":"nyc report --reporter=text-lcov | coveralls","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@tyriar/heap-tests":"^1.0.2","ava":"^0.24.0","coveralls":"^3.0.0","nyc":"^11.4.1","tslint":"^5.8.0","typescript":"^2.6.2"},"files":["lib/*.js","lib/*.js.map","lib/**/*.js","lib/**/*.js.map","src/*.ts","src/**/*.ts","typings/*.d.ts"],"gitHead":"73e7529495d2ce9b7f4fea85aede7ee2ed1e65c1","_id":"@tyriar/fibonacci-heap@2.0.7","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-DANf9u0VN5oWrRk31B+xCy9mMNx1H9YhWUaTzCzU0uBruj/zg8u9JSw5qpArntvfJxaW/gWGWbQtzpAkYO6VBg==","shasum":"73a441ca0e5108d2621c72e9b34dcf566387f078","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.7.tgz","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEY8uELYKf3Kg3a+HbLzEZJtyU6olp24j86/ceUjuJB5AiAMdmqvVbjKfZH7npC6qK6hKS4y9FzX/y9+tW0A3crqHw=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap-2.0.7.tgz_1516585379046_0.10440306668169796"},"directories":{}},"2.0.8":{"name":"@tyriar/fibonacci-heap","version":"2.0.8","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint --project .","test":"nyc -x lib/test mocha lib/test/*.test.js","test-report":"nyc --reporter html mocha lib/test/*.test.js","watch":"tsc -w","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@types/chai":"^4.1.4","@types/mocha":"^5.2.5","chai":"^4.1.2","coveralls":"^3.0.0","mocha":"^5.2.0","nyc":"^11.4.1","tslint":"^5.9.1","tslint-consistent-codestyle":"^1.13.0","typescript":"^3.0.3"},"gitHead":"a25fccb597945c710095d3bceb4cff2aca7cebd0","_id":"@tyriar/fibonacci-heap@2.0.8","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-yujW2S09dkH3uBUiTR5GtMni7LgQS2bSm1ezjugyUzuzM7JUkNvNRMwUL7/bee8gv812zhw1Yw/aIzL47UbTVQ==","shasum":"819fdff85fb559790539ff8a347c246777b4011c","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.8.tgz","fileCount":49,"unpackedSize":140502,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJbjctBCRA9TVsSAnZWagAAdgsQAIr5bQcVVTC53PgxcNIG\n6CwLirtZA87hpZbJEQXqQunnrh77esYa4z5OTgJZt0xOkw31b4JX5/nLOFKG\n5IlhCgGvHUF6nA+ryx5lsP3V0aagYE4+nxz0ru/M+W6FXeR3H1JI/Zq2OaUK\nql/BiX2Xic2XzpxdRlsvd4+OpceD1p/SAon2dSzhqDLu6l7qZm+9qtV9MsbL\n2hKhOKoMO6HNwVL4AeM4R4RTfv+fOFOXiHK4OVrFys4VfTW6jdvMVVzsBa9h\nhCSbGDB1yJ3GKpFcsZCirX357T0D/a9j+BIsUiJ4XGEippulvcYOeXMiWGmC\nQFD3DbSiZ1McYbgKTLLRkEQKkpgy8/+QDEIuO5XotOk423ykmDrfDL9OWkbT\n/7AQJw1IEtSrY6Kb6PzETgwFLUnM1ZJrv0xb0jvvmnepqucQQflPcqDDZpdP\njIeR9u4WZhBBiAn+BqOWUbDMZ2njmo6AQnCwGQHgNgmidEEqqGe/OgXettph\n0Va73q6Ijqm/JgXLpDVM+zHU/tEjmqFTFozNDfnSeD61Lcv40tPUchMrvI46\n6VL6Pi5PG85pj5GK9IlLeuHn4I0LNseAuKYhzssXQgmJoK1fps87IhN9/7pG\niYrVbYAcxi7XqYSCtEhIbykkFLa+mxzhz9M73Nue98oj2/lK3QNZgUksXRy3\nUmMf\r\n=YqUz\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCp2DO2NCV1L0iDgNcK+qEmNAKddoAP3EslsfHOETzUbgIgTeWAUrGdGw80vM+eRHurfEa8EZt9f9EEn+lfZY7Vkys="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap_2.0.8_1536019264494_0.03642829753318333"},"_hasShrinkwrap":false},"2.0.9-beta1":{"name":"@tyriar/fibonacci-heap","version":"2.0.9-beta1","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint --project .","test":"nyc -x lib/test mocha lib/test/*.test.js","test-report":"nyc --reporter html mocha lib/test/*.test.js","watch":"tsc -w","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@types/chai":"^4.1.4","@types/mocha":"^5.2.5","chai":"^4.1.2","coveralls":"^3.0.0","mocha":"^5.2.0","nyc":"^11.4.1","tslint":"^5.9.1","tslint-consistent-codestyle":"^1.13.0","typescript":"^3.0.3"},"readme":"# ts-fibonacci-heap\n\n[![Build Status](https://api.travis-ci.org/gwtw/ts-fibonacci-heap.svg?branch=master)](http://travis-ci.org/gwtw/ts-fibonacci-heap)\n[![Coverage Status](https://coveralls.io/repos/github/gwtw/ts-fibonacci-heap/badge.svg?branch=master)](https://coveralls.io/github/gwtw/ts-fibonacci-heap?branch=master)\n\nA TypeScript implementation of the [Fibonacci heap](http://www.growingwiththeweb.com/data-structures/fibonacci-heap/overview/) data structure.\n\nNote that the primary purpose of this library is education but it should work in a production environment as well. It's certainly not as performant as it could be as it optimises for readability, abstraction and safety over raw performance.\n\n![](http://www.growingwiththeweb.com/images/data-structures/fibonacci-heap/fibonacci-heap.svg)\n\n## Features\n\n- 100% test coverage\n- Supports all common heap operations\n- Store keys with optional associated values\n- Optional custom compare function that can utilize both key and value to give full control over the order of the data\n\n## Install\n\n```bash\nnpm install --save @tyriar/fibonacci-heap\n```\n\n## Usage\n\nSee the [typings file](./typings/fibonacci-heap.d.ts) for the full API.\n\n```typescript\n// Import npm module\nimport { FibonacciHeap } from '@tyriar/fibonacci-heap';\n\n// Construct FibonacciHeap\nconst heap = new FibonacciHeap<number, any>();\n// Insert keys only\nheap.insert(3);\nheap.insert(7);\n// Insert keys and values\nheap.insert(8, {foo: 'bar'});\nheap.insert(1, {foo: 'baz'});\n\n// Extract all nodes in order\nwhile (!heap.isEmpty()) {\n  const node = heap.extractMinimum();\n  console.log('key: ' + node.key + ', value: ' + node.value);\n}\n// > key: 1, value: [object Object]\n// > key: 3, value: undefined\n// > key: 7, value: undefined\n// > key: 8, value: [object Object]\n\n// Construct custom compare FibonacciHeap\nconst heap2 = new FibonacciHeap<string, string>(function (a, b) {\n  return (a.key + a.value).localeCompare(b.key + b.value);\n});\nheap2.insert('2', 'B');\nheap2.insert('1', 'a');\nheap2.insert('1', 'A');\nheap2.insert('2', 'b');\n\n// Extract all nodes in order\nwhile (!heap2.isEmpty()) {\n  const node = heap2.extractMinimum();\n  console.log('key: ' + node.key + ', value: ' + node.value);\n}\n// > key: 1, value: a\n// > key: 1, value: A\n// > key: 2, value: b\n// > key: 2, value: B\n```\n\n## Operation time complexity\n\n| Operation      | Complexity |\n| -------------- | ---------- |\n| clear          | Θ(1)\\*     |\n| decreaseKey    | Θ(1)\\*     |\n| delete         | O(log n)\\* |\n| extractMinimum | O(log n)\\* |\n| findMinimum    | Θ(1)       |\n| insert         | Θ(1)       |\n| isEmpty        | Θ(1)       |\n| size           | Θ(n)       |\n| union          | Θ(1)       |\n\n\\* amortized\n","readmeFilename":"README.md","gitHead":"a25fccb597945c710095d3bceb4cff2aca7cebd0","_id":"@tyriar/fibonacci-heap@2.0.9-beta1","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-hXf/+XP1xkHPiP35wharBjbE5E2vkH6pCkC1I8mpjA3QO3JDL5Ep3sabfH/OGQmfd1u+c/9mIA7eBxfeBWL9oA==","shasum":"d8718cb602e771c1f32ab3317c8b826cc75370b5","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.9-beta1.tgz","fileCount":13,"unpackedSize":37160,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJcBA76CRA9TVsSAnZWagAA1/wQAKNrrRbpUF4dNumh1u9e\nDeUxymYiP3CsW6HXaRTSi2c73PN08aLZbNtnvijvlvFVdwmYDSidVaiWL1GV\nTNhI2S/a05M9bygIyKfg2aD2u1SgdCUv3w3K15FwRQfFw9uXU8ZE9X1tpcCQ\nC0Dq+h+QZBmSm6OdMYlbF80+whFyvoNcJrf8uY0BYurPc6G54QqEX6rifmXF\n5tUAjbjaYawqXXZrR9c8o8oPDkGva1S2wJyBgN+57YoA42XDPMCs2O30J7a/\nsFhksqU0X0ZwNGz51dsA0MbvcEsi9l9J4134yYKkfufhUdzSFhY9HEf0vGuJ\nyf0gVCdJtFqbtrKtrMMp2QgcDvTV5G64kisONE3Aqtraw86ZPe9xjF9lAUCk\nCFD3KjP8wJiLIn0PHKeUUImUk8i84NQ0i3AUByD1D+5Fg2Cs3/i7T0h+TGen\n+ACl0nJ/uEUMjeUU6LeN3vb0iwktM2z9iRdsQlLCstcHyvM56LkY/oUsXsUV\nRIDz3IP8FhE2y+U6u4of9vuG8m8U/nlD7JPY0sHFaHiHjeKJ3G2uolB3S6hw\nMNqmen9N9tcpWiF68e9qsLcXHU9myep4FJWaj8fvLXSoPSeNIT8BCHewE1/9\nKuqc0PkNMy0C2HsCLx7Hacd4LtKcyOVVIfjj4biRq0nJkq8TQebxo6KEEkLd\nEWnO\r\n=873i\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDxW91MniPEjKyGGiIChjVVkb3Gs5Zjwd87ZHgzmDzqZQIhAN72rgkqjwQsVkroe0Dcpz931ibU08zBjM5XuwfPDIsD"}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap_2.0.9-beta1_1543769849629_0.49125534457468856"},"_hasShrinkwrap":false},"2.0.9":{"name":"@tyriar/fibonacci-heap","version":"2.0.9","description":"An implementation of the Fibonacci heap data structure","scripts":{"build":"tsc","lint":"tslint --project .","test":"nyc -x lib/test mocha lib/test/*.test.js","test-report":"nyc --reporter html mocha lib/test/*.test.js","watch":"tsc -w","prepublish":"npm run build"},"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"main":"./lib/fibonacciHeap.js","types":"typings/fibonacci-heap.d.ts","author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"license":"MIT","bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","devDependencies":{"@types/chai":"^4.1.4","@types/mocha":"^5.2.5","chai":"^4.1.2","coveralls":"^3.0.0","mocha":"^5.2.0","nyc":"^11.4.1","tslint":"^5.9.1","tslint-consistent-codestyle":"^1.13.0","typescript":"^3.0.3"},"gitHead":"6f8ef75dedccc7f6350ec1e88ec2ccce88c0eda5","_id":"@tyriar/fibonacci-heap@2.0.9","_npmVersion":"5.6.0","_nodeVersion":"8.9.3","_npmUser":{"name":"tyriar","email":"tyriar@tyriar.com"},"dist":{"integrity":"sha512-bYuSNomfn4hu2tPiDN+JZtnzCpSpbJ/PNeulmocDy3xN2X5OkJL65zo6rPZp65cPPhLF9vfT/dgE+RtFRCSxOA==","shasum":"df3dcbdb1b9182168601f6318366157ee16666e9","tarball":"https://registry.npmjs.org/@tyriar/fibonacci-heap/-/fibonacci-heap-2.0.9.tgz","fileCount":13,"unpackedSize":37154,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJcBA95CRA9TVsSAnZWagAAHKUP/24n6WIz8FA937+oaXAx\nquQj6BtJOewdLh2uWFwRC92fzswLl/xpQFTem/jb/bUOnRq01hVC/XHS7JXF\nMHe9uBGapQ3zgLSgfAy2YdF9GeFX7HgeNc5emFSwESQ6A0F1R1UP2lHheBDF\nMEj6B5epbDhuxeVy0qD+u9SF1jjGwaf4DqS0aFSlgH5rQ+iqjLJhLn6shk3i\nrLFclC7YLjtZv9naJsBlCXxuFfnzT76PsYLXA+RWAXOEJ8stUiigAm/TrRBq\n0bxO30LAlIj0cA9d8jNzh7IERVFwChTYpvLzq1Kuar5hXo0RlV/t0JM61di2\n8fYZkpCA/l9XcaUIpj0Ne+2Ph4J9/TDR9G4KpDVglNB5elxbEbWsxU7jDxz9\ntn1W+b7Mj1Iia3KOTUfCGZ7wVtRUwS55DpRq5r+GVvNvDm6ikuxuWJbxUzJO\nR2GNpmIn9q9hqPMSzLJTFS6rtt1qFPvY/zUZOm6YilLL8TXZsNjjHirOFZiF\nL/GyvPIQs8+E8NSPUT2UnDlUaNxxoOYwz6xYqJHH3g1zIjrPNLBpNNmSn0w+\nWu64gbKR57YcOnGcuF9+Olfffh3gHwcpMnDQhD9QS6G34jM+KeRfWV1C/sTJ\nzFtP7+5NNqT5yq1hSwHdkN3vPaudDpRQbhBln65Qh5tZCm1g6lIA09I9vV8v\nmt06\r\n=3voK\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICQw9CwXg2a8MYfilXExf75B84UJfJ/YzYNFC8rZJ/OIAiACbLZOZ370tQKKKPSsfF8+WtRULXYRQlIo9imJ7aasNA=="}]},"maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/fibonacci-heap_2.0.9_1543769976609_0.13838281601071944"},"_hasShrinkwrap":false}},"readme":"# ts-fibonacci-heap\n\n[![Build Status](https://api.travis-ci.org/gwtw/ts-fibonacci-heap.svg?branch=master)](http://travis-ci.org/gwtw/ts-fibonacci-heap)\n[![Coverage Status](https://coveralls.io/repos/github/gwtw/ts-fibonacci-heap/badge.svg?branch=master)](https://coveralls.io/github/gwtw/ts-fibonacci-heap?branch=master)\n\nA TypeScript implementation of the [Fibonacci heap](http://www.growingwiththeweb.com/data-structures/fibonacci-heap/overview/) data structure.\n\nNote that the primary purpose of this library is education but it should work in a production environment as well. It's certainly not as performant as it could be as it optimises for readability, abstraction and safety over raw performance.\n\n![](http://www.growingwiththeweb.com/images/data-structures/fibonacci-heap/fibonacci-heap.svg)\n\n## Features\n\n- 100% test coverage\n- Supports all common heap operations\n- Store keys with optional associated values\n- Optional custom compare function that can utilize both key and value to give full control over the order of the data\n\n## Install\n\n```bash\nnpm install --save @tyriar/fibonacci-heap\n```\n\n## Usage\n\nSee the [typings file](./typings/fibonacci-heap.d.ts) for the full API.\n\n```typescript\n// Import npm module\nimport { FibonacciHeap } from '@tyriar/fibonacci-heap';\n\n// Construct FibonacciHeap\nconst heap = new FibonacciHeap<number, any>();\n// Insert keys only\nheap.insert(3);\nheap.insert(7);\n// Insert keys and values\nheap.insert(8, {foo: 'bar'});\nheap.insert(1, {foo: 'baz'});\n\n// Extract all nodes in order\nwhile (!heap.isEmpty()) {\n  const node = heap.extractMinimum();\n  console.log('key: ' + node.key + ', value: ' + node.value);\n}\n// > key: 1, value: [object Object]\n// > key: 3, value: undefined\n// > key: 7, value: undefined\n// > key: 8, value: [object Object]\n\n// Construct custom compare FibonacciHeap\nconst heap2 = new FibonacciHeap<string, string>(function (a, b) {\n  return (a.key + a.value).localeCompare(b.key + b.value);\n});\nheap2.insert('2', 'B');\nheap2.insert('1', 'a');\nheap2.insert('1', 'A');\nheap2.insert('2', 'b');\n\n// Extract all nodes in order\nwhile (!heap2.isEmpty()) {\n  const node = heap2.extractMinimum();\n  console.log('key: ' + node.key + ', value: ' + node.value);\n}\n// > key: 1, value: a\n// > key: 1, value: A\n// > key: 2, value: b\n// > key: 2, value: B\n```\n\n## Operation time complexity\n\n| Operation      | Complexity |\n| -------------- | ---------- |\n| clear          | Θ(1)\\*     |\n| decreaseKey    | Θ(1)\\*     |\n| delete         | O(log n)\\* |\n| extractMinimum | O(log n)\\* |\n| findMinimum    | Θ(1)       |\n| insert         | Θ(1)       |\n| isEmpty        | Θ(1)       |\n| size           | Θ(n)       |\n| union          | Θ(1)       |\n\n\\* amortized\n","maintainers":[{"name":"tyriar","email":"tyriar@tyriar.com"}],"time":{"modified":"2022-06-13T01:19:12.293Z","created":"2015-11-09T02:14:13.217Z","0.1.0":"2015-11-09T02:14:13.217Z","1.0.0":"2015-11-09T03:42:53.877Z","1.0.1":"2015-11-09T03:53:26.057Z","1.0.2":"2015-11-11T08:18:22.282Z","1.0.3":"2015-11-11T08:54:21.502Z","1.0.5":"2015-11-11T09:38:08.303Z","1.0.6":"2016-05-27T03:24:55.839Z","1.0.7":"2016-05-28T03:28:46.723Z","1.0.8":"2016-10-16T04:31:09.489Z","1.0.9":"2016-11-05T21:05:05.322Z","1.0.10":"2016-11-20T20:57:08.428Z","2.0.0":"2018-01-01T17:52:41.357Z","2.0.1":"2018-01-01T17:53:53.377Z","2.0.2":"2018-01-01T17:58:55.345Z","2.0.3":"2018-01-01T18:29:24.694Z","2.0.4":"2018-01-01T22:15:48.413Z","2.0.5":"2018-01-22T00:18:23.141Z","2.0.6":"2018-01-22T01:14:07.803Z","2.0.7":"2018-01-22T01:42:59.210Z","2.0.8":"2018-09-04T00:01:04.681Z","2.0.9-beta1":"2018-12-02T16:57:29.751Z","2.0.9":"2018-12-02T16:59:36.789Z"},"homepage":"https://github.com/gwtw/ts-fibonacci-heap","keywords":["A*","computer science","data structure","dijkstra","heap","priority queue","tree"],"repository":{"type":"git","url":"git+https://github.com/gwtw/ts-fibonacci-heap.git"},"author":{"name":"Daniel Imms","url":"http://www.growingwiththeweb.com"},"bugs":{"url":"https://github.com/gwtw/ts-fibonacci-heap/issues"},"license":"MIT","readmeFilename":"README.md"}