{"versions":{"0.0.1":{"name":"graphology-shortest-path","version":"0.0.1","description":"Shortest path functions for graphology.","main":"index.js","files":["index.js","unweighted.js"],"scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^3.0.0","eslint":"^3.5.0","graphology":"0.5.1","mocha":"^3.0.2"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.1.1"},"gitHead":"90826c3f0cacff7f12d02e206e7664ee0323c0c8","_id":"graphology-shortest-path@0.0.1","_shasum":"a65908c88f6b2a88cc7b5ad46fdd10aacd862472","_from":".","_npmVersion":"3.10.8","_nodeVersion":"6.9.1","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"dist":{"shasum":"a65908c88f6b2a88cc7b5ad46fdd10aacd862472","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-0.0.1.tgz","size":3284,"integrity":"sha512-QcNJIzZLn/8o6SAItE7B0U91Ekl1hMFwdVQX7nn1nLag9vw6owpkAWDDFgbzHGhFA6DsxYQQU6h5jihk2ebCTQ=="},"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/graphology-shortest-path-0.0.1.tgz_1487355535533_0.7622897047549486"},"directories":{},"_cnpmcore_publish_time":"2021-12-23T08:59:50.288Z","contributors":[]},"1.0.0":{"name":"graphology-shortest-path","version":"1.0.0","description":"Shortest path functions for graphology.","main":"index.js","files":["index.js","unweighted.js"],"scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^3.19.0","graphology":"0.11.1","mocha":"^5.0.4"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.1.2","mnemonist":"^0.19.0"},"gitHead":"4ef14072fa38becd539efdbd3fea7c6f1f533c2d","_id":"graphology-shortest-path@1.0.0","_npmVersion":"5.6.0","_nodeVersion":"9.8.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"dist":{"integrity":"sha512-HZ2S0W5oTQ2z0RVJfhEJbhpR/mmMqWHOHqRG36CcB1+HvIA3mIto7BDDKY500OeE1ZjC/JghMzxetWIUBlHfOg==","shasum":"ac48cdb3716a352301b357badb301dd1acbc09bc","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.0.0.tgz","fileCount":5,"unpackedSize":14973,"size":3987},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.0.0_1520612319574_0.4580668331382576"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:51.154Z","contributors":[]},"1.0.1":{"name":"graphology-shortest-path","version":"1.0.1","description":"Shortest path functions for graphology.","main":"index.js","files":["dijkstra.js","index.js","unweighted.js"],"scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^3.19.0","graphology":"0.11.1","mocha":"^5.0.4"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.1.2","mnemonist":"^0.19.0"},"gitHead":"d77b24b9ae67910ecc01b6f605c17fc89f3166cf","_id":"graphology-shortest-path@1.0.1","_npmVersion":"5.7.1","_nodeVersion":"9.8.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"dist":{"integrity":"sha512-VBKd+MWlLF8TmGUAqO9w5PJE3+9QfdwCtX/xEQnDI9uxmsyJUPcS+DzyDdKAdUZOCdcBjflUONnIkZqiuVVOgw==","shasum":"ee3221658b7dbe23c4a01b6fa92b381db58fb195","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.0.1.tgz","fileCount":6,"unpackedSize":24672,"size":5901},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.0.1_1520936825445_0.3700970868131941"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:52.028Z","contributors":[]},"1.0.2":{"name":"graphology-shortest-path","version":"1.0.2","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^5.9.0","graphology":"0.13.1","mocha":"^5.2.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.3.1","mnemonist":"^0.25.1"},"gitHead":"e49addf89523310490d9852d84241a96050ab8c2","_id":"graphology-shortest-path@1.0.2","_npmVersion":"6.4.1","_nodeVersion":"11.2.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-2Xxs9uPa/IL4bYDh2v1HorBhm/RhTl5GxrHbyGMIAWswu7fUQtQxGYCFRwmG0F61eF07162X95zKfMW8oqzsjg==","shasum":"b6cad12792b1ae0d5c82f2d6309b8d41116c2928","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.0.2.tgz","fileCount":6,"unpackedSize":24693,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJb+/T1CRA9TVsSAnZWagAAHWIP/3uirv/Gl4paAgvtRfHq\nIeOAHM6Z54Kb7UAJ/8dW6ecsrouZVV1xS7j7USQzgJxeIFlSuFs7KXMBuB8B\nWNu6B8DrT+oHb+8z6LPy+Rh7rBmb8UMP8lTbueBC1o1lMwtW4crSjPvK0YgG\nUn9DV7zJrZR7vCx24OThbFM+de/CfOBqDIXfbgnS5caCjNmXy8uLTCtwk5C3\nZm2WAxhiQvl4kSvTYaHdP03DczUS6MlJmXRhLgRr/ATiKQU8FqVmQO+Abxh9\n9Zg+WAd/xrygBH+l1AoPmKoSfv59bRKW+dYF5W1+THfj9xPdBJNEdnV9RbQu\nFhlQVeSfShLFdnFCi1zKC0YcEvwKGn3qQtI3Ru5e40SBQfPQH4srIZXIkwc4\nb/rOgh8FkistTiaGmVzKhgMrTEJ4B4rgIwxI8rJCSERDCttXeoaqBKViOzOz\ncqSTlfl6OYVtnnGoh9LIpSwlW9O6J9p9HC7wWVr/msnl3kvj6PCzyoWJOypD\nL/zLkE9+kFB96C3rsbFXLOrx6vZ2iFV8M8pE7Y9KshxvCZgDUT4hrZVDBl66\nTnFgyWTMWmfRGWevlnhAPc10cnRXn7abqCpKua/T+2Sd7qD1RBHpx2gxeaEL\nYkGi1XV3M3LvsPeQW9onriVYHC/piwxJO2SXMQAYF3Iac2zUMFG2wggGh2Rd\n11mo\r\n=HMWb\r\n-----END PGP SIGNATURE-----\r\n","size":5918},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.0.2_1543238900757_0.6789820189622393"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:52.920Z","contributors":[]},"1.0.3":{"name":"graphology-shortest-path","version":"1.0.3","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^5.9.0","graphology":"0.14.0","mocha":"^5.2.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.3.1","mnemonist":"^0.25.1"},"gitHead":"af7256c30e83c2b9d3cc398d1df2c83885062f32","_id":"graphology-shortest-path@1.0.3","_npmVersion":"6.4.1","_nodeVersion":"10.13.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-t+NHtq0CRTmOfifmE4st7uHaMm2zo0MR2P2y/YWcg09+WJFFoKzUcjVUluivnvPRBCFkcWXqoMlDc2Cq4ipdQA==","shasum":"0602603bdaa1205c743054f179b9583d19ff9641","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.0.3.tgz","fileCount":6,"unpackedSize":24693,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJb/ESKCRA9TVsSAnZWagAAqTkP/RHNF+uLKSLaFRPcY9rf\nJgh8aJun+tm+Qvrko8uCMZtRrxS6Z9Ga9DW3Ez83R4+/+BbHmsA8hQ8j3a1i\nha2U91TNX6tzYuQUM5gcn2tdCPXmmTcaOzLdOBLsFq2GQaoVGRTEM3ZjXOdV\n0J09F8MejorwjPDAmW2UPmihr11SVoZAliHg8+oZ9VB3hr/Gj3acSr4Is9NS\n1LrG/p3OYwtJviD4k31B6kuvvkjAlAvDH9pQpE7vCOsMev/4yUyJcY3hF5xB\nrD5Qtu3PpxzuIU4xAQoqt4LVRFsBS+qsCpsWmqjLpkaHC7tUmcaWKt1zY0Mu\n8YcvqJZZczcMlWEhVp+dO3p0HVLOWK7vMwU0d1+dWTbo5YYcAGyCZlm7tYNt\nv7C9XqhD4e7Z460mSKA4svCpa8euZteeZoXndbmUICRli0pT7pIkvuY8waUA\nMCbMh5OsgVo8K0aTAjuYLAx3yrGZ/a0SH5r1jWy3g8Ri+nDdg79HSr6dt4Oi\ntOMSCdpfHjaMmmThiyKyzuW9mXZqU+HOhR0y9piJ4uPBuxP8jtTSQnn7ofDg\nsIyhduRRbzuqrbw0Go6MXaJ5tZnq+esWSzG5fbOkgouUC4Pv2ZpHsm0s9n8x\nE+yNSMTi+nqsfUTcPDqq06qMa8F/pTjOWRNe64lugi+C9nWluV3oLOqztzi3\nJ2nL\r\n=4H6Y\r\n-----END PGP SIGNATURE-----\r\n","size":5917},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.0.3_1543259274016_0.34396015438391236"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:53.244Z","contributors":[]},"1.0.4":{"name":"graphology-shortest-path","version":"1.0.4","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^5.9.0","graphology":"0.14.0","mocha":"^5.2.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-utils":"^1.3.1","mnemonist":"^0.25.1"},"gitHead":"f56a154fb4b2269de49bcc636cfb92bedc816891","_id":"graphology-shortest-path@1.0.4","_npmVersion":"6.4.1","_nodeVersion":"10.13.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-ej1jmBQGJdOqOM1gfMwPPvMKCYttEoWP4s0k2tZafcdhZ4UdQv/55QtUvSSKfnCOxMceQ63lr5dBaBrvCu1kHQ==","shasum":"674c5da8836f7353b12d3bb6c4182f099799e4c5","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.0.4.tgz","fileCount":6,"unpackedSize":24799,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJb/RZkCRA9TVsSAnZWagAAaRsP/jFFqaD8OY6EetFXeUTr\nhuNTCwwGvDEhUMMEKikUUwEkBpAUbc3zsl8JZG8lC4CbqukYThCA74gGw3mN\nZD2m3GJacVhrgWzNh5kOHmHYgr2QrGpbGXfSyqZd4ben8dMl/M7Ujo8Mt0/S\n+GJOf/GSVs7S9mEPNoTCu2OkXWmxcLLW38bHUmyOFgyWccQ/2GQYZ1s9sCca\nT/cF2SQzFUWDPIAOLRHS0sb6EvhOOK1xAB51KaU1LG1gxLIvWFIuxtK7Je8D\nXAuoGARpAp2wbzeWX+onWeaifNbKVixwWTAXtn8MHX9WY7iuiWkAztt7KdZG\n3yiFgI62L2NYORnwjRUw9BTyH50v8wCZpcCI0o6kNo110WKfxTshZLAz3Zj9\nnnaVtAAShSlOvZSTytcEPyEfiY4d6e4pz7/WHtynbAzNKrrxmZuXct8EcznQ\nfMgGoYj6wmFDBFk+GxvtKHnkTT9t1s31IguzXqp8aAmIcQ/q8OmuliFpwLTi\nXJUfaRgwi5QQIYwmORycE488Xpo7T23geIajndbTfc1KC/oOSlyblJ3qlOyE\nmgKrJgARixRAZxzEm3hUBkJwSh2EfLWnWrz3ws7sltrYNOi8l63ZEZuX/nc+\n9TLZw0dNmChObKuhvnYjKBV3Yh+YhXsYKF0fse1D6Nlh+pNGS63x943rNORQ\nZ8/b\r\n=v46x\r\n-----END PGP SIGNATURE-----\r\n","size":5945},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.0.4_1543312995751_0.22874000049023469"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:54.110Z","contributors":[]},"1.1.0-alpha1":{"name":"graphology-shortest-path","version":"1.1.0-alpha1","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.0","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"dependencies":{"graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.32.0"},"readmeFilename":"README.md","gitHead":"ba4b4057199902da3120a490379e7d74938da094","_id":"graphology-shortest-path@1.1.0-alpha1","_nodeVersion":"10.13.0","_npmVersion":"6.14.0","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-rzW1AfIcsM5I7TUtOrNjRAG0utRijUZHU3xbWx32e/Y+B6JrDFyDDyyxIp8hYDzQAJe6cwKxAzGoOuD4niok3g==","shasum":"3fd364df6f2b3a8c5a5e13625f9bf6631ef7621d","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.1.0-alpha1.tgz","fileCount":8,"unpackedSize":27587,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeWBKXCRA9TVsSAnZWagAA/VgQAJCWjw+X6BnARPyovQ6t\nkSQyah8ebUL7Tumohm6e+SQ5YTdxu7Di78CMYbtZmPiYCUtXMszRcM9EocXZ\n8SiPbezB08bE/7THQsTQG28S9WB6Om1XjzQ8dLNy9vzFURBvS6YEey0+L5Hc\nyFxsruiR/LSmRp+Cs/TCDdCAPB5Az9hvm0OIM0veePYbDbK4L/03ocTbSuqm\n4lamoe/KPQaKKQA0/NEEN7cHYqiHTunCvx5yos6LgaLg7lIW448SotPTsQVZ\nnizdLGePW1qIIRjUcwTQZpadgbnxrWpBjeZQDhIMBwjQpncW+sMwYS/l8+UK\nxXnsYTPWbi2kUbTih7HabNw1lbGqPwXlsQvDFHdLiEk2PswLonO6gmRFAzJa\n0nnPS1NMDH1HhuqLl3D9cLLpRc/y43+Ate0OLNH9ffOq6QwDmvT5EWp6+GxY\n//kkYS3Xbp3gjKxMGi/A7d7nU+Y5SgGG+q5AHXUxLwq+m9qEZ1jpedv0fPUx\nY7wUnAV44Lo1HrjLYQRFggRnjemM9w1fFvHdPuyB4vNlGAfuSS25Kn4QjijD\nMCV+e2FqKeJ4e4KMc/m1GCxPE1qE1lrdlB0joacoXeuooBFsEk2QmZXefJqJ\nWVEC7KwoRwhrb+kMocCRe8IDHdBWPyvGyXUlUcN/BnsCrRVAPR7xFsjnZC41\nIExc\r\n=U24n\r\n-----END PGP SIGNATURE-----\r\n","size":6749},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.1.0-alpha1_1582830230464_0.1963940722338069"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:54.971Z","contributors":[]},"1.1.0":{"name":"graphology-shortest-path","version":"1.1.0","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.0","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"graphology-indices":"^0.2.1","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.32.0"},"gitHead":"e803a80b92639ea9b2cc10ed45819a8de4431f3d","_id":"graphology-shortest-path@1.1.0","_nodeVersion":"12.10.0","_npmVersion":"6.13.7","dist":{"integrity":"sha512-nQKwSG4V+aCw25jPF6re6ho/Y3jDm1jDQ+7lasahwlEGu6oHBD6sWU/03zgWTufRN2iT+/hZaUSGOQCurnNbpQ==","shasum":"8bb54521efb6e62dd5e1d4bd117093d7706a3b24","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.1.0.tgz","fileCount":9,"unpackedSize":25695,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeXRVpCRA9TVsSAnZWagAASYwP/jIwtZkrkI/LmAARGrBr\naUWTZQnpnQqSMIDe/A2NNfp57Cm9d6G3Q01DBM4uTdwHxXlK8sVSj9Xo4eOu\n3cMNr9qSSyGVc22wQQ6VMa5QToqrp6ijvbVyx/J0DTP3rKaVObUVSMj+jrOh\nd5aMEONmUwGwvslXSWfhxgd7IyeMhPlNWI+Z8w5hIqxnu1BKMlFBb9la5Iqo\ngTUQbJ0BG3ED2/wqQwVUcp8sXV3HuzwpDZi/2ClCgDC4wHu3IUd1ii9TfiLD\n8QJhzqaShLRdtjI3dvuxJhtyLur8PALO+/ap32K0mnQxyO6RmfDfo4wQmBys\nWft4TSP1/1SN+sZtzn1AqEVJZRRt52VysXb9bIKwbZPypQnYrFx/1yLmacpv\nJ/kjbvsakMYSIcCSgsULiio1uJnHh/seReobpEq84UtdWi1PgUc5J0K3+D4J\nFQCj/eJEhtroosGxQOFY70h0S5u/ZaFwTZcX42PXiEuGXNLWnz0gS6U9CwdY\n3x1y7JOyJyz6dlusTem3SMqGl9RJQfyDHB0Qcb8pZfQi9tCLJ91WSCWiY3lk\nf5dVpK5+qrX5emJtKPbmqFV1BNot+hQvenMeG/CFsd0wzXHBlcFd9+HvxDqG\nxFAoR+ApqAy9tczTWiLlZvJm3O8YhKG4kM/+vGqBl30L6xgFnwdX7pG2kHLp\nlWi4\r\n=pUVB\r\n-----END PGP SIGNATURE-----\r\n","size":6287},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.1.0_1583158632980_0.8344607239922348"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:55.825Z","contributors":[]},"1.1.1":{"name":"graphology-shortest-path","version":"1.1.1","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.0","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"graphology-indices":"^0.2.1","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.32.0"},"gitHead":"7198f0073cee14ff3831ac0d3b8c784bf338c506","_id":"graphology-shortest-path@1.1.1","_nodeVersion":"12.10.0","_npmVersion":"6.13.7","dist":{"integrity":"sha512-SSHsont+7tiFD1BulxWMDxBsZCHeNYCR+KkCusbNH3cGbvKD9PCMSYDEkow6kcfDZ+ZERmOB28byh/udmIijig==","shasum":"fc19e4bff542137a71995d74e083388f9eb24c3e","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.1.1.tgz","fileCount":10,"unpackedSize":30526,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJeXRWaCRA9TVsSAnZWagAA7HEP/jrOYultbW2IDrix39Vm\n/M64C7b6VWIMrTRJQbMqRjTCTspFwRBsxFU5gmgBqguRLlIUwgvL3xWiK0p4\nTcW5J1bUPhwkzZyOYi9elpyng5StPLEhGx/SUWH7nsGNe/i3y1Jtry6nImXr\nMiaLF4oM8lGNiDr5I3IHEj3qMKerESfeRkzaZVvMKAtw5O4iTwTnKR2WreUZ\nXWpB6tht9lTPcaAR8MgmmeLFpzCv5h2EoBjAIht/OeR68rt86LtzLkV9sOb+\nK2Bs2+RFapv0zuglEII/Nt6bwPWEuTs3bg0Svnu9wZ+zYOV/KbsH3/Mo6aGj\nBTkWZ+YZUmUMWg9cAlR4MWiTOyfpfLBjHqRlfW30tugzbrAVBKH0D9LJE4lb\npnFkpai8D3GJjSpqFe72Fd2nQPFTlgttrka8tZczZEQOJ3PsePs0lXldbnfn\n8HC02LZqqj1ZGb6Qw4ZJd1rm4cYRinNEzIWB0YTzgFG73pJbH8APwoZNrBLE\ndmc8xVd0jZWv0DwQ2+LaFbkJcsBElMqHDmFms1xmjOAnCrcw61e9jUNb2PZV\niiIwNVebJgRs6m6S4PqeLHIvGX1E4dxKq9rv892UWxg7AyPGEKbh4Wd5InDQ\n23ZNAZH5mbMGI1dVNhHr0ZLzicgGSlcS8ad3D4sDhmuPHZoCQ5E/iYtrxHub\nipGq\r\n=wB/w\r\n-----END PGP SIGNATURE-----\r\n","size":7039},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.1.1_1583158682458_0.6894777787750781"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:56.683Z","contributors":[]},"1.2.0":{"name":"graphology-shortest-path","version":"1.2.0","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.1","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.0","graphology-indices":"^0.2.1","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.33.1"},"gitHead":"d226f60cd457737c718fb1a2de1bdc49efade42b","_id":"graphology-shortest-path@1.2.0","_nodeVersion":"10.13.0","_npmVersion":"6.14.2","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-+ndsrmF+PEytcp67JNbsP912tduN92GZm0zASSkLdrIh10xHjlmFQp+g50CrUfZ//ftPOQ/rxCSc5YEhT9qt2w==","shasum":"35153b2ee897da93bb160114b3690fbc43bafeab","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.2.0.tgz","fileCount":10,"unpackedSize":32607,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJecfyVCRA9TVsSAnZWagAAOUcP/0gVQsMeb4dUefWjwT9v\nvOg6KXHq6CsZ4D47k0uBv4pQTxdjB3jdhqV3MM5u+FsNFDdd+XaC5z0iLASh\nVMTNUZxaqqBICYCSzCnsriASKm6TzRRriEY/KVEJEoMoysZbx1/opmENHfL2\nSOcFo/HZ3aAYKNK4BqLZ5WY2RGzC0uNL5x8rK++xYi3eqGCZKZGQs0YTsyvH\ns7J7CVShPJMzC9fMli/EF1x4pH1cGkwNvPgsMSaJzcGWMgagvfJ0trOqx19t\nYZvLhD69j1aIOP+FsCvRSQleTJcnwce3Qdyk8SBmdHHty/qUaCjpU1s4uvjZ\nfUqaG5r+nvIKat3hKP1stQm6kDC+UZZKPKxJRLhjTLy5dFpOM0XCE+nwsw7f\ngdaIxBcCZjbvmbgICF9HEjAOGth9fQ92V/lUv44KsslV5NIA0k30P9F31Kpc\nZAoBgRwTSckb52fDlGxwc55G9RcUbckzaypDiFjXvJWlLiNGYKEdtnrD9sEH\ntLAWNDAFiaqujqLfWz93mEGzlwQ8MrVetmKg4k2aKG9KTF53Hvz2Quw7ma5Z\n24BdH6UPeDSa0mZ6XF7cunVKnNdMJAwi5NMmww8lagQ2gPIZyQkfA3P31tGr\nqTn7dMZQCWmTQaK1THspFYy3x3Jljo3V9qOXn7OcLAnmYVOeXCgi7Fq1TScI\n1GFB\r\n=kMrJ\r\n-----END PGP SIGNATURE-----\r\n","size":7295},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.2.0_1584528532948_0.1047106611248565"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:57.543Z","contributors":[]},"1.3.0":{"name":"graphology-shortest-path","version":"1.3.0","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.1","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.0","graphology-indices":"^0.2.1","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.33.1"},"gitHead":"b5a7c6adde2f98f4b911af3aa645eee6da215e62","_id":"graphology-shortest-path@1.3.0","_nodeVersion":"10.13.0","_npmVersion":"6.14.2","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-Jfe0mJypxzhOoSU3nzSsPpJLJQFEQJAs4C8SN1bqPj1ZMgs+JMWvDTlGX2pGi2BxbNpYmjRMzSxQ0lwyG6N3Vw==","shasum":"ee27e6b217d7705076cb1cd754b1803d2bafaf25","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.3.0.tgz","fileCount":10,"unpackedSize":33721,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJechg8CRA9TVsSAnZWagAAK+YQAIJMEDFtcj6pAc0n/K6A\nFlCcMCtT3JQzUKOV25wX0raSy1OUMkeF47t5PT2OK91NiezmA/4178R9wy9e\ngENEWbbTSF63iMfUFz38qYHgeVp3D3i3dF+lnzcZm9mueFNOoSLB6pF9GcDG\nMWVJLTBDSe9SNzDBS1ndn02aIc4Sga4D2paa6lXipyxRIs68aTMNybnQPy5t\n/CeY532YMJHdJArnT1HovCSxdqV2XYFfhBxUHeCPUc9MmRylDchMsM3ORhMb\nIPdkEveFlnWqP9EUSJ0TEiQKN/c1fjPkp9jAhrjfS0+qv2YyOHBk25JFgBId\nwrHmofbc8CEUyyeoUTJyn5r/rSm91dCEnPLG6ukrA3MsD1LmrbUXK8lTaORH\n758JCnHUSCza0ekiDmNnxE4FkeFk8MPLEO22FHKU8IlnVJkXfppnwQu2aSh+\nb5+X2ySx0dlm6G7F2RzUjlrpxBmQFIEcCfVbf4ThZsg8sHmaLmtm8uHF8Y1I\nNyNrp4/TzwRREVdKgbOARcD66MCNxnOHXr0fz1Rfv5eFBb1qbSA/1+RTIyuF\ngazc0KQa3/3H771qItIXvQSSkif3iKk4n9IP8tTYUtig/gme84gnnoGlwCHR\nNBeXDaUuhbdnhoNFPRAsHOOwY7CMuUMzoopgVvl0TbCvBKiN86ojXaE6qa5a\nt8e4\r\n=QMeP\r\n-----END PGP SIGNATURE-----\r\n","size":7469},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.3.0_1584535611707_0.9428102611523472"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:58.401Z","contributors":[]},"1.3.1":{"name":"graphology-shortest-path","version":"1.3.1","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.1","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.0","graphology-indices":"^0.3.0","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.33.1"},"gitHead":"c2ea4b6d1b794fd64942bf59af22b452dc523a45","_id":"graphology-shortest-path@1.3.1","_nodeVersion":"10.13.0","_npmVersion":"6.14.4","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-N4rRuVMCmB3woS7rvezjEDWiXydwx0V5+Pmi/kHFVMk1bOLI1B/KKZOM4xDA+P5k7eViwxXxoNs9lQcTDkhBIQ==","shasum":"bb9e080437d98db24b31be947b6248877b8a26cd","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.3.1.tgz","fileCount":10,"unpackedSize":33653,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJegelzCRA9TVsSAnZWagAAeBgQAJdlJjokoSXmPKU4wj22\n37mf6iPnFs1gteBzsqMrOLlN2i1QNHCEZC6EiQ841gbLUnU9WJ/lSNbsFcms\nd3Z3xsV1Vwz6/iZkA61/6uHT5ypF36HrZ60B0H8bgV1cnAv+5yi08i+5RrGy\nzxtaSz+YszgToJM09/L9KGC3GKJ8J3B6jy+j7atiuPEt9w6HcBwIAxokaI+a\n9UOcHPfRcO2Or7nsuOGhS7q3OYZwUJ2nGdiUgq1yvILPmDqmgQUu6LAIzo1Q\n1ZBb671ObmqR1TGIUFdowLmkt92DVy1V0GerO2DN9wxvgE6DcPdylIWTk7vP\nUEJR8fD9K/yhWaeqOTk2+GQuDR1sm2kUcLqh5aJHNtjgUYINzMCJmNFagrRt\nBA/mDhQ3V+VYD5S3hhctATfFC6QwLuA31HzrSsXiCMLWT114EJfo/WSqJ0oS\n9WA0kP9TuKakiawk4rH616Loob0iCu2CFys4DTc9akYyIcsBws4xwnU3L7V5\nue6vBHXqk8ObWkKEAsoYeew46cv9XnXUBfEMFR6Ddm4TfCfOwnd/lXNoG1Ux\nJbED6LVg2RJ+JJp6zCY1ZSCaB+nGOPYlCGGY+yeDjzbXtDO7DEGQvj0tYTrJ\nmE1vnPZeoLHqN3mGlhoCu/V6difKcMuVLzr0o1elBb8Xtg08/pqvhaY/K1nf\n9Ha4\r\n=pBxn\r\n-----END PGP SIGNATURE-----\r\n","size":7463},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.3.1_1585572211419_0.4078055157647542"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T08:59:59.330Z","contributors":[]},"1.3.2":{"name":"graphology-shortest-path","version":"1.3.2","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^6.8.0","graphology":"0.16.1","mocha":"^7.1.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.0","graphology-indices":"^0.3.0","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.33.1"},"gitHead":"0dbb9635bfbe89b1e9815e1fe4d977091ca21cde","_id":"graphology-shortest-path@1.3.2","_nodeVersion":"10.13.0","_npmVersion":"6.14.5","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-7khCBKVQlqGFD2M/BbWrid84g25oed2dylp2Jx+xjzj2qt45QWaGOmcLF1pXKvGvcPt2uly4WTIIDaY9NWgGfw==","shasum":"d430a590d9c816841600aa04df515943ec58426d","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.3.2.tgz","fileCount":11,"unpackedSize":34296,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe4zzZCRA9TVsSAnZWagAAe2AP/R5z7lFdttln5dMRJwd8\nZ9QSB0GXYaYmVqLocfR/BB8hJzuL/ySMil+qcgsaHH1jlSsKrRBgpdqp1Cgs\nDn/o9MBHRzUL6wajyGjqN2ecq5Z3cXeEf7J3D/lJPFm4d6h9cfzDC+Mw35g1\nkvnRBJa5sTmL/C7aLyTtjlVQUsKua7gxwUkMAtIC5IxaUkvDHkTuIdMOcTuF\nfq5dmMyKDJRdkOrsIghjruZXyTvvlgmk/df/Z/Vf89HoK65mlH67T2EKzQfn\nlG8WE1ZUHpHCbVNg9o22mU6XUOlaEnj4FtshT2CBzu0k0C7aCXAZ9HJGHZqo\ndAsIBW4f3FO1zAIfLpIhBmsw51FHk05Vwz5cWdh6Kv/TwXOIDjLNFAO7Kdxg\nfe4rKTXZTT7M1m+Ns+o5TeCEUoVrX3YwX68RMv00IT9hCQqDJ5y6oH9YiGe1\ngOFBYbKTRJ7nD9aXkjuzljjTefTbrAObwJf7fWBPquMMZWBwWPmMxruAUCEh\np6pjBuVHrrLM7vhkA2mvAAtw8z1G286APQodNbXw6U4OeY9xi7+dQGHgQvJx\nBB62ef/9w6NAyBIbbNR+1OLZGqe+5ySrXTjMFHOc39Ljcix4Yhj1O2oLtUQH\nKmYAmpBkBCaspxDYRS0anKdIW3xyVJXRKXpdDyRvgCL2RllJL6ZE1I//OhdP\nCFEV\r\n=uUth\r\n-----END PGP SIGNATURE-----\r\n","size":7585},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.3.2_1591950552924_0.1446762078051682"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:00.211Z","contributors":[]},"1.3.3":{"name":"graphology-shortest-path","version":"1.3.3","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^7.2.0","graphology":"0.17.1","mocha":"^8.0.1"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.1","graphology-indices":"^0.8.0","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.36.1"},"gitHead":"e1c352ae910acd7400628c26cf96623bc8161c15","_id":"graphology-shortest-path@1.3.3","_nodeVersion":"10.13.0","_npmVersion":"6.14.5","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-0mI0rEX3PiOUHdiF6eG9lwDCn5zDuSWvuvwqFhWUgcyQMpT0hzuFGXQkveF74x+2KGucKVZCL895EuHfsPYzWQ==","shasum":"f34722f8e3db5f11c17ac4e04d1c2fdfa44eae95","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.3.3.tgz","fileCount":11,"unpackedSize":34494,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe54ScCRA9TVsSAnZWagAAf88QAJ1t5vsyHlVE5uZWbNue\nI/e6HLZ42qHahhlWvVyTlnC4UokgS3ajQ1FMDvhE7lfsJEWXxkGHbTEXPA//\nuIqWgilqRlr1LEndeAvMlIibslf6wHTMfMXNAJj0kiK0a9UM69Rs/9kNvc7j\nzgss43SiFDos6dVFabrvXnBlchTrNsZf3EztQGNdhwznrdse3qYNPB6BDGQw\nLyKjY9z7NU4H/Gbtd+bpQeS+hUNMrWvRtCEXPWIW2lm85XBGK1dYBe2z5vV2\nQ3pSOMn5rItEnHCn8LY2ZZxARa7NZ9WVsIM0YiZ+QHoqg85YT0PndmzOMBbf\nqphBjdPLfjbdiBG8enJ0MLtVw7UOQ7UCaMd8QvBfoqyP4jSdJhPTaK9rDxWE\nb8rSirRE/U7CAn3c5JbC/oPs8I+s3nDTQ5FgxQV28Rm7OUr9+Ygw/vdjnx4z\nniAAuPqukUw8FWHhGZ2GwCqel1ma85UdJ9c71Rlfu/gbKv+HQfnyKwSUFyAA\ntw4X+NsPfcH4qApgyq3wh+pSZJGrJXm9FDEn6YbAXYmzk4MheG4RjH/r3UDa\n6tOpK2tgZeQfllQYABEMHp79KmSLBVIvTXdIWIx2YmEJtQ4mmHeSVxbpuIrb\nBa/ibtRZbNpj/tawpjo0rF/Rka2o0Nbo3obKS0qnk99sz/zMPejBNrmSWOmC\nELC/\r\n=+jyN\r\n-----END PGP SIGNATURE-----\r\n","size":7611},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.3.3_1592231068203_0.3086492550737092"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:01.083Z","contributors":[]},"1.3.4":{"name":"graphology-shortest-path","version":"1.3.4","description":"Shortest path functions for graphology.","main":"index.js","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^7.5.0","graphology":"0.17.1","mocha":"^8.0.1"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.0.1","graphology-indices":"^0.8.0","graphology-types":"^0.16.0","graphology-utils":"^1.7.0","mnemonist":"^0.38.0"},"gitHead":"fc44079e16e6fc2c406d46e548ea808b15af1be6","_id":"graphology-shortest-path@1.3.4","_nodeVersion":"10.13.0","_npmVersion":"6.14.7","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-o7pW+DxodGkppkA3MRtO5O0JHyE6Pr2e5WwL9Wm39zz50vWKnoqwt06IsL3V6dhHy1fl2YwdwPkZeShTNyaDyw==","shasum":"b66a448a634edb4680d92a3d5b7521f21a7cc702","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.3.4.tgz","fileCount":11,"unpackedSize":34507,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfHo6GCRA9TVsSAnZWagAAVlEP/AiP0FpIfqno4PdwPc1M\ncJY3LKVXzXrUoJbVOBsTLlXjVhTI9icv3hAQuuReM+Xg1Q7BEYyWdP7HWZQq\nqc7QfBbR555jr6jcxM7EJwL0C83ijbjQC2jF8ksea7Gsj/jgw3AtXzvy8HKU\nw/G7SvHCBYztlvF5rEmX9QrM5fwdqnjQwV43G7MoRLXOXgxpSPuU9GewUhMp\nLEcAMO2QUT23PTPkKmPEmgYNjd9ieLUAZEhDu7VTnD/RxuRPB5dxGEISiqXM\nuPqmveUkJyPLfwBkUU1lzJZWLXOPuDN3dDerMD7vAvFF0NNWkuM9cN2fCNhO\nnokvXnWN21PXEB/z98epx60oz92EelDi901vwQTWvguKaR9xaUlVTqCHCZuA\nbGNw+pBGCgCC8K+mxj+qq3GsDFuETDN5hdIjjZ3YkGFlwzTC/uXYvHMKZnOG\nU8it8xgWZ5CwXeZ0dgB2l4fyioSKomthJXtcP344qF0pAlDSGpA5mmRuKTKb\nLhTBx9z5B5syzV4SjzqhJq154D76iOAfSk7KagufGBAQBDqz1CWd8Q9MitnJ\nNJvc5ZtRA6KTYH/zeROKAEV91xdevJnMXdLeeJGdSGv+xsDh7d79q0kOqUqn\n0mFtsNKxf1u3slFHLcrSxn4UwgflDNMhtFAJjhEQxuOENtmklYRBELNfoWT6\nROFG\r\n=rj7z\r\n-----END PGP SIGNATURE-----\r\n","size":7617},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.3.4_1595838086297_0.880179425006437"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:02.003Z","contributors":[]},"1.4.0":{"name":"graphology-shortest-path","version":"1.4.0","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^7.13.0","graphology":"0.19.1","graphology-types":"^0.19.0","mocha":"^8.2.1"},"peerDependencies":{"graphology-types":">=0.19.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.8.0","graphology-utils":"^1.8.0","mnemonist":"^0.38.0"},"gitHead":"3c723602db3c7b262455e0d081a892b5952baf90","_id":"graphology-shortest-path@1.4.0","_nodeVersion":"12.6.0","_npmVersion":"6.14.8","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-FAPSS7tVHmhF5ah7pjDyprxjVfmAzC1Dm9YyFiCCDX3oOBIPBC166sVcgLpC+A9sfj1lIHOw+STEVZWK+ILzww==","shasum":"d0435b1ecd77a2f97e91028af301c84ee6f326d5","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.4.0.tgz","fileCount":11,"unpackedSize":34597,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfqXrMCRA9TVsSAnZWagAAD48P/ilWbnTA4JQyC3JsL15Z\nl5G8dqhL0W4mMZ/2USShAFdKr7qzzb6+gzTQDhel1WOYMl9aNWjoy51KnI4W\nYiptDY67l+oUx2IrxNdygSuK58Rfx//2/GQqgutwUh33rdZVszigz7WZ6+8W\njAtH5J8YdLepEwrHfeUwXEhzztW1UraGr/RxNHp7/uYJh+sTMqnYnong7rna\nCtPc8uYft+FUGAxfPeoBkVIERcz+HMFb8zT7ptT0rkpZ24UoSnxJOTfUHit6\n1b7LKzrxHrKH0iMfexySKZIDMfu6yP9GB3jrBP6RT9Bk8vKjVOLiO94XF/w8\nJZadcnd+lNntrls7nGe8jIMqKxs0t7V70hpMoBZcEkw7TBE7mTvTJZDK+Pm9\nG0+i+hwdwAF6oto3iw/ABXnOV/HNiMdZesr/4175GX7XrSipHX8nFD8JBkE2\n7OBtTZM7XhGFd7iagdddXHUVUpUFidpEBVXstQYxXgYI7msK0C12WXXr1nMG\n0YoHNd583MuoZYqmkpEuXkpqAXA8iK1DC/C67RrMgl4Gcv/xwhggQmTSzbVY\n2whuKBRR6xnOxxb8eSPWnVmqDQqYf8VyU2USIWauTkaUin67nBZ6z4tfrqjR\nD5H6vzUCmZEBOPDckS0fmRowjxPw6vp7q69RFjr5m8Ga8JsHFA1vBaOBobca\nR1fx\r\n=k+73\r\n-----END PGP SIGNATURE-----\r\n","size":7632},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.4.0_1604942540275_0.43595056747986294"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:02.956Z","contributors":[]},"1.4.1":{"name":"graphology-shortest-path","version":"1.4.1","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","devDependencies":{"@yomguithereal/eslint-config":"^4.0.0","eslint":"^7.16.0","graphology":"0.19.2","graphology-types":"^0.19.0","mocha":"^8.2.1"},"peerDependencies":{"graphology-types":">=0.19.0"},"eslintConfig":{"extends":"@yomguithereal/eslint-config","globals":{"Set":true,"Uint32Array":true,"Int32Array":true,"Float64Array":true}},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.13.3","graphology-utils":"^2.0.0","mnemonist":"^0.38.1"},"gitHead":"4b6618d8b3a96641e1d0663d49569f7378756649","_id":"graphology-shortest-path@1.4.1","_nodeVersion":"12.19.0","_npmVersion":"6.14.10","_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"dist":{"integrity":"sha512-u9R9dxcslmepOw9lIsyYIiTEMBiWXossaWp4Nx9ReV2blMQBN0yfLBDVQXySvWWqyAE974kJD3MAFsizNCODSA==","shasum":"da4aec48e2f7c35f7d2ce35e1b94f42e85bb0f08","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.4.1.tgz","fileCount":11,"unpackedSize":34598,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJf4io6CRA9TVsSAnZWagAAnVAP/jFXjRz+GrbmM8/17hru\n6d+rp0nVvVVL4eYaXkn1tpZ/8JgnECvtxFgKsF2wglBoPkNr/SrrVhxSnfNn\nA1nLnKbKaNa4h3Y+BCux/uB1IdO7I9ckvUuTAKRQnMSYCXzma6ptlIK9K3FC\nV+k6xlZRsnGk/jO5HF9hTQyuu3rvxO9IACeRzOd2ubSqU+4f4tkaOH8aR+rX\npt2rIQdkUG8d0teo+Zh9Pj92XNpiNXdQnFMrVjqtaA+XwAErAi7JsuULmQdz\nPjSUK26F4uuMz4qQap9ltfDpQU9vL4a0CDxCb6YkE+6qduYp/BmWAyRzTrUE\nMCj13j11HSp3rpxtVtgG6B6xbWuLcVcpPElYkHZW1iOAq4KJDJ6sGYKQwQIM\nVF7zQSQjOHvA6W0CZTvZ3VBi7vjuTEuLLmOBMhYVxl67ejci51gIdB2L4B+D\nZ5mFue9RKqmP3GDaRADlYuyhU+fUftzk3IGFMFmS2e5fBX8kW33iNtSa9s18\nzxZbvkz03pzROL2tRz/zGS3rbYuuQKXy4/EwsXHN80tX0iUnXortnE34nCat\n7D3smzdCfQukMpyb/7x8HFLVyYZqxYNw0EwvaxxeKCUisam2zN4yDTAFrkZY\nDa2fZxrh8bMe6DdCmB3n77SHwSlhQJkKLM/wI//g2ypUVNSI+5jLOMPr4io8\nOM4/\r\n=q2th\r\n-----END PGP SIGNATURE-----\r\n","size":7637},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.4.1_1608657465569_0.5314925489827325"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:03.810Z","contributors":[]},"1.4.2":{"name":"graphology-shortest-path","version":"1.4.2","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"lint":"eslint *.js","prepublish":"npm run lint && npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology-shortest-path.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology-shortest-path/issues"},"homepage":"https://github.com/graphology/graphology-shortest-path#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.13.3","graphology-utils":"^2.0.0","mnemonist":"^0.38.1"},"eslintConfig":{"extends":"@yomguithereal/eslint-config"},"gitHead":"6db86d5aaf9be763644991fdba58f1d2cfbdc08c","_id":"graphology-shortest-path@1.4.2","_nodeVersion":"12.22.6","_npmVersion":"7.24.2","dist":{"integrity":"sha512-3m++qUBEb+vuq1ZYdgUN0q8XrUJsAcrhw8Cps6Gvmd8T+8wdn/eJa+Jgx9hokn9HXSPcgupWm2j9Q15w1uZxjQ==","shasum":"ff10ab6b54e122bfb99c1a883f4355855f15d9e2","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.4.2.tgz","fileCount":11,"unpackedSize":34269,"size":7501},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.4.2_1634310233469_0.30991381962829667"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:04.670Z","contributors":[]},"1.5.0":{"name":"graphology-shortest-path","version":"1.5.0","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.14.0","graphology-utils":"^2.1.2","mnemonist":"^0.38.1"},"gitHead":"775753111613bc20f48429926ad12fb293223995","_id":"graphology-shortest-path@1.5.0","_nodeVersion":"12.22.7","_npmVersion":"8.1.0","dist":{"integrity":"sha512-EhsncmQ4kcgU/VeyZSmBMcRCefXebLrIegBddQuZhBed6kbyXJEPcx/snMrFAD01Doo6VJ6+YD+dKKZYYVrgAA==","shasum":"3ecab10a4f3f1aeb855786af7a35c5426116d9f4","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.5.0.tgz","fileCount":11,"unpackedSize":33928,"size":7520},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.5.0_1635675422212_0.9677276026977304"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:05.551Z","contributors":[]},"1.5.1":{"name":"graphology-shortest-path","version":"1.5.1","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.15.0","graphology-utils":"^2.1.2","mnemonist":"^0.38.1"},"gitHead":"c6b41deff18a791412967516c9bc4288307dc43d","_id":"graphology-shortest-path@1.5.1","_nodeVersion":"12.22.7","_npmVersion":"8.1.0","dist":{"integrity":"sha512-FCLbKwcHSiAib+gD/qtNVqJ0PF/mYqOQMriECqUc+I5w1OpGg9LysgNkr4KbzbfCWgNBpZXDiBwcGV2RUWnbeQ==","shasum":"0d5ef18356757daa069cfc2b688f12e4bb55fb47","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.5.1.tgz","fileCount":11,"unpackedSize":33993,"size":7530},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.5.1_1636357620642_0.4294331326134153"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:06.425Z","contributors":[]},"1.5.2":{"name":"graphology-shortest-path","version":"1.5.2","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.16.0","graphology-utils":"^2.1.2","mnemonist":"^0.38.1"},"gitHead":"b9ad87bf24ddb281c9001eb9e3ebb11948008533","_id":"graphology-shortest-path@1.5.2","_nodeVersion":"12.22.6","_npmVersion":"7.24.2","dist":{"integrity":"sha512-MP95GPiPSkutan5miLfWrMQMWKO/rVSzrfqknrKZ2HyJYDFWonr0IDZOn8MsgR8bNCXKUTd3cFAzKo8hVISx/A==","shasum":"0b60b58be6949b5886c1d229f09d6ccf7c679426","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-1.5.2.tgz","fileCount":11,"unpackedSize":33920,"size":7525},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_1.5.2_1636714315258_0.9129711397451803"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:07.270Z","contributors":[]},"2.0.0":{"name":"graphology-shortest-path","version":"2.0.0","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.16.3","graphology-utils":"^2.4.3","mnemonist":"^0.39.0"},"gitHead":"987141f119d323581e309df03fc8610bb9c5e8c2","_id":"graphology-shortest-path@2.0.0","_nodeVersion":"12.22.7","_npmVersion":"8.1.0","dist":{"integrity":"sha512-6dJWgbr7w4YQKb7Y0w7vhZn2qAkqP+J0IhE9F3vz/HZcx7VSOqnNfTGtYr44BQ5ohdXj0l9iKjlWCb+3vqEINQ==","shasum":"27a01b3a9980872bd44a197fc77114623dd2b302","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-2.0.0.tgz","fileCount":13,"unpackedSize":34119,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJhsgtMCRA9TVsSAnZWagAAcw4P/072/PCYMdafrCWMjstQ\nC48iNI68Q8drWOPS+GAcjfVnxmOrPcXowYaccuQ9S9C9ei+2WLTUpj3VcNdD\nRiqgCZMXWSOgz6yrQ677hBm8GTpppzdxHDvxJfOf3Kqq1FGLbqDZHUw/tWLV\nEMHzdEaSWVgHOykl3KZpU86l1CsVodX1sY7EIfh99f99NyIyYHM2sh9edIuT\ndOI0GmUSmzh1GCWCWu9FftM5dT60jp3k7V525ESu6KUwE8sjbszApUc3efqV\nHlWrWWCDv+kFIGWRuOI+E1bCPX2o3BryW0gC9vaA1OA8m63E7aOhMbMJtn6R\nvp3Ppc3Yw2RUMy8Kvdr2Kwbarna8Nl+P/nBuTc82YE1cmyIcgPCtr8Pr9W9f\nI7AME9+dbPyXddpubrPfJxvPM/yJDms8U0f453lFu1VYsbmpNk+rq+C2qY1A\nLbPl0GPXkWwunBSqFR+MXG8tOPdPrBgK+ZNeNGDXghmSges3N2ngXv0pgnii\na+7c68mj8HYZ94sdgMTTDkPMgvoX2ThcCgPlvdD/5efEmLbyVhA9ddSUKsGr\ngcyui/4G4JEv8C72wiscSsWO510xcKj+QKP435S3HLwlZIg1oSK5QYSVRyrP\nBkK8QOGZMfN9YO10PFxVicY0EQyH3Z34lGTvphcPTwrGCZsToMvHmX/aJsmw\nTq35\r\n=VsF9\r\n-----END PGP SIGNATURE-----\r\n","size":7738},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_2.0.0_1639058252368_0.022528951295120114"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-23T09:00:08.155Z","contributors":[]},"2.0.1":{"name":"graphology-shortest-path","version":"2.0.1","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.17.0","graphology-utils":"^2.4.3","mnemonist":"^0.39.0"},"gitHead":"15bc57005ed3bdb1e75f8f91cd54b2628277b719","_id":"graphology-shortest-path@2.0.1","_nodeVersion":"14.19.0","_npmVersion":"8.5.2","dist":{"integrity":"sha512-IYDbhK5EO+eiHjEXL0S+kcxeKYq6eFAfekeGA4YxH+XiAFV4UjeOWnjS0KjxD5+guoDwZYG7jXySExrV93YukQ==","shasum":"2b332b5049d52b7c45c620e50c79036b7724bb70","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-2.0.1.tgz","fileCount":13,"unpackedSize":34119,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIGRghF3lNNfdTOvrFRqq9cczxU1dcb/tfyzGJkEC2dr2AiBVzXR7BRNeBbuYW92TELr4rVEe8Z1q8OQNgChdrLC21A=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiYVbYACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmr58g/9G4NWGgqi/eezr5CRud+zHaIMZOQBWYV4BtlBj56ehr2JDYZC\r\n7rXdbNe3vgr+sGAoyYHNV9nfleWwKOY4k4/7gEd3RWi7+jsRftHI51Kvr71W\r\nFgCaeswiC4RmN0n3MHbeKv9HlbfDzZqdMtZ1K3ZodoGCoVbGnBqn3oK6e3gY\r\nGn9t8iawHpQMkPJweajNlaoIkMO7OpN6itUnkKVfbd5F/b3WCSJYyrTsXFOe\r\n7rk9lrb5+DedWY71th5cyqOYI9JO02YRW9OUu9yCppI9FWWncoUTStQYvMf1\r\nu2fHVylpNLQVKf4kFprlASL8sQfB4zB6eziAGUcRuZy9BImW7KI028zMCz5L\r\ngidakYn3DVMauI/K66YZo7H1/Lqcr3OcyAi6TmVJIh9OKLo4yxMwO2Cx8GWw\r\nvbwT/UemzbvzndBHyk9mfmlZN3nio3/ch7/qVnaG5LxZ02enW9flin6SVBgh\r\n5B9uMOc7dv6IgyrCZqURsatuXYTfq2XMQ/1Qg/rwr2sjHwsFvI6kNEfpQRdq\r\nrj+IcDWHNDa6NE5ExdxS4bp05p3GflH6c0afbulv79LXrzZWdx0ytoyROQgb\r\nT+u1Y5hxz65X/qflcospIXRA9nOs7WgYSr5dWi1/LuL0eFElP+NdhbtH0IIN\r\nqU5whxuliSWhZKC/wWYWpFgpAWCL/5wknFM=\r\n=ndxn\r\n-----END PGP SIGNATURE-----\r\n","size":7740},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_2.0.1_1650546392768_0.6772165734641893"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-04-21T13:08:45.214Z","contributors":[]},"2.0.2":{"name":"graphology-shortest-path","version":"2.0.2","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.17.0","graphology-utils":"^2.4.3","mnemonist":"^0.39.0"},"gitHead":"ea5e01d75be168b6044437de3088d63856b8880c","_id":"graphology-shortest-path@2.0.2","_nodeVersion":"16.19.0","_npmVersion":"8.19.3","dist":{"integrity":"sha512-hlGvh4Yb1Vmd2J7wT8Q8+t4RQ6Tx+9wRYm0/fZB9PZJ4uW3nml5kJ7yXZ2+JYWT+7wLLmY5mg3o9bLSAWmv/jQ==","shasum":"01385d2c0452ead890da2203b30d00177397678e","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-2.0.2.tgz","fileCount":13,"unpackedSize":34260,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBG/FPYuerMsTe6nuSlIbhQA+zOoZTzsJ2JWmwXeD7opAiA3TxT2piyLy8rnj/ghVuNuqnjucfXXD3xrqwi6wpjDuQ=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJkAbhlACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoWmQ//SwEBpuljbG6tE+NyqBa7/2dXhYGzWchjjhOFS8a2pr5qyrPM\r\nFLZ1PnZOjXcPjE/GUEtuRqSTwkYaWY/HO3DKze/tTEoJqzrtZfq+X/WROEwe\r\nd0WcQ1g2I/L15DmAO9ZblLPPRfqzyVuOOe2eo7iz6kwEB0pwcEPjQR/xOBxD\r\n8mx6udD5xG6xlSSWRziL+Nc5Y4o9ylVLpp5QYfkYtmoKoYTI14an1kLtE/Om\r\n4aSwAZK6N5lNp9hK7E6mZtuSwRVhE5QsDV6MaNxqn3FuCbXyuigTNB5SzqTg\r\nJcw+gFO3tyhmn0hqKIO8vHKnrJ9EG8btjt8YQzse4i9lD23ouwREPKmzcug5\r\n8pnp9JGWdT8iYbFZkwyEY7l13nIK096DgA2DLcxz9iqXv75U7V3mHQ+dmou1\r\nmLBXDBPnGaF/ZiBEG2u8c8JhufhobZtGY4du2rPpHSb3JoEjBQouzECoRj6r\r\nXB6boElQ6JxIkdBUIHxt1ASi4zuPnjf3GXfRG0oO+Cynqm3M8LIged47VF+N\r\n7K7wcy1VmknJtVRSEL9cwKHOGYw2YJ44RwZmZg+DYjYKiBQIdpjSAenakgVU\r\nfHzi+FQ5lpbhPNat9saLX/ibCjb/MIiR9R0Xo8IjTnlawtF0NSJCCXXjxW4w\r\nRL9+5mgc3P4WGDspT1gyRb+vFA4D8eT0rKA=\r\n=8LzU\r\n-----END PGP SIGNATURE-----\r\n","size":7751},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_2.0.2_1677834341483_0.10545007518318461"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2023-03-03T09:05:41.660Z","publish_time":1677834341660,"contributors":[]},"2.1.0":{"name":"graphology-shortest-path","version":"2.1.0","description":"Shortest path functions for graphology.","main":"index.js","types":"index.d.ts","scripts":{"prepublishOnly":"npm test","test":"mocha"},"repository":{"type":"git","url":"git+https://github.com/graphology/graphology.git"},"keywords":["graph","graphology","shortest path","dijkstra","a star"],"author":{"name":"Guillaume Plique","url":"http://github.com/Yomguithereal"},"license":"MIT","bugs":{"url":"https://github.com/graphology/graphology/issues"},"homepage":"https://github.com/graphology/graphology#readme","peerDependencies":{"graphology-types":">=0.20.0"},"dependencies":{"@yomguithereal/helpers":"^1.1.1","graphology-indices":"^0.17.0","graphology-utils":"^2.4.3","mnemonist":"^0.39.0"},"_id":"graphology-shortest-path@2.1.0","gitHead":"a7c74ce8540a8ddc0e57d7b12b80d8057f5c067a","_nodeVersion":"20.11.0","_npmVersion":"10.4.0","dist":{"integrity":"sha512-KbT9CTkP/u72vGEJzyRr24xFC7usI9Es3LMmCPHGwQ1KTsoZjxwA9lMKxfU0syvT/w+7fZUdB/Hu2wWYcJBm6Q==","shasum":"b5c5a568e7c86b24cbfd2042f9d84f2a54e0b331","tarball":"http://123.232.10.234:8212/nexus/content/groups/npm-public/graphology-shortest-path/-/graphology-shortest-path-2.1.0.tgz","fileCount":15,"unpackedSize":40519,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBpEbW9EnFL5Z9M6nubNaVdVokJQgemq9QbDhdwsdX3xAiEA7kzLBScXDNCHQtIbI0GlhFhqQ8P77mcBJxsF4yKMYwY="}],"size":9082},"_npmUser":{"name":"anonymous","email":"kropotkinepiotr@gmail.com"},"directories":{},"maintainers":[{"name":"anonymous","email":"kropotkinepiotr@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/graphology-shortest-path_2.1.0_1711558301037_0.4537284035579128"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2024-03-27T16:51:41.229Z","publish_time":1711558301229,"_source_registry_name":"default","contributors":[]}},"dist-tags":{"alpha":"1.1.0-alpha1","latest":"2.1.0"},"name":"graphology-shortest-path","time":{"created":"2022-01-26T12:56:41.849Z","modified":"2024-03-27T21:03:57.662Z","0.0.1":"2017-02-17T18:18:57.544Z","1.0.0":"2018-03-09T16:18:39.631Z","1.0.1":"2018-03-13T10:27:05.493Z","1.0.2":"2018-11-26T13:28:20.880Z","1.0.3":"2018-11-26T19:07:54.157Z","1.0.4":"2018-11-27T10:03:15.929Z","1.1.0-alpha1":"2020-02-27T19:03:50.801Z","1.1.0":"2020-03-02T14:17:13.078Z","1.1.1":"2020-03-02T14:18:02.561Z","1.2.0":"2020-03-18T10:48:53.040Z","1.3.0":"2020-03-18T12:46:51.813Z","1.3.1":"2020-03-30T12:43:31.544Z","1.3.2":"2020-06-12T08:29:13.294Z","1.3.3":"2020-06-15T14:24:28.351Z","1.3.4":"2020-07-27T08:21:26.397Z","1.4.0":"2020-11-09T17:22:20.415Z","1.4.1":"2020-12-22T17:17:45.767Z","1.4.2":"2021-10-15T15:03:53.685Z","1.5.0":"2021-10-31T10:17:02.425Z","1.5.1":"2021-11-08T07:47:00.777Z","1.5.2":"2021-11-12T10:51:55.416Z","2.0.0":"2021-12-09T13:57:32.508Z","2.0.1":"2022-04-21T13:06:32.949Z","2.0.2":"2023-03-03T09:05:41.660Z","2.1.0":"2024-03-27T16:51:41.229Z"},"readme":"# Graphology Shortest Path\n\nShortest path functions for [`graphology`](https://graphology.github.io).\n\n## Installation\n\n```\nnpm install graphology-shortest-path\n```\n\n## Usage\n\n- [Unweighted](#unweighted)\n  - [bidirectional](#bidirectional)\n  - [singleSource](#singlesource)\n  - [singleSourceLength](#singlesourcelength)\n  - [undirectedSingleSourceLength](#undirectedsinglesourcelength)\n- [Dijkstra](#dijkstra)\n  - [bidirectional](#dijkstra-bidirectional)\n  - [singleSource](#dijkstra-singlesource)\n- [A-star](#a-star)\n  - [bidirectional](#astar-bidirectional)\n- [Utilities](#utilities)\n  - [edgePathFromNodePath](#edgepathfromnodepath)\n\n## Unweighted\n\n### bidirectional\n\nReturns the shortest path in the graph between source & target or `null` if such a path does not exist.\n\n```js\nimport {bidirectional} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport {bidirectional} from 'graphology-shortest-path/unweighted';\n\n// Returning the shortest path between source & target\nconst path = bidirectional(graph, source, target);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n- **target** _any_: target node.\n\n### singleSource\n\nReturn a map of every shortest path between the given source & all the nodes of the graph.\n\n```js\nimport {singleSource} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport {singleSource} from 'graphology-shortest-path/unweighted';\n\n// Returning every shortest path between source & every node of the graph\nconst paths = singleSource(graph, source);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n\n### singleSourceLength\n\nReturn a map of every shortest path length between the given source & all the nodes of the graph.\n\n```js\nimport {singleSourceLength} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport {singleSourceLength} from 'graphology-shortest-path/unweighted';\n\n// Returning every shortest path between source & every node of the graph\nconst paths = singleSourceLength(graph, source);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n\n### undirectedSingleSourceLength\n\nReturn a map of every shortest path length between the given source & all the nodes of the graph. This is basically the same as [singleSourceLength](#singlesourcelength) except that it will consider any given graph as undirected when traversing.\n\n```js\nimport {undirectedSingleSourceLength} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport {undirectedSingleSourceLength} from 'graphology-shortest-path/unweighted';\n\n// Returning every shortest path between source & every node of the graph\nconst paths = undirectedSingleSourceLength(graph, source);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n\n## Dijkstra\n\n<h3 id=\"dijkstra-bidirectional\">bidirectional</h3>\n\nReturns the shortest path in the weighted graph between source & target or `null` if such a path does not exist.\n\n```js\nimport {dijkstra} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport dijkstra from 'graphology-shortest-path/dijkstra';\n\n// Returning the shortest path between source & target\nconst path = dijkstra.bidirectional(graph, source, target);\n\n// If you store edges' weight in custom attribute\nconst path = dijkstra.bidirectional(graph, source, target, 'customWeight');\n\n// Using a custom weight getter function\nconst path = dijkstra.bidirectional(\n  graph,\n  source,\n  target,\n  (_, attr) => attr.importance\n);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n- **target** _any_: target node.\n- **getEdgeWeight** _?string\\|function_ [`weight`]: name of the weight attribute or getter function.\n\n<h3 id=\"dijkstra-singlesource\">singleSource</h3>\n\nReturn a map of every shortest path between the given source & all the nodes of the weighted graph.\n\n```js\nimport {dijkstra} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport dijkstra from 'graphology-shortest-path/dijkstra';\n\n// Returning every shortest path between source & every node of the graph\nconst paths = dijkstra.singleSource(graph, source);\n\n// If you store edges' weight in custom attribute\nconst paths = dijkstra.singleSource(graph, source, 'customWeight');\n\n// Using a custom weight getter function\nconst path = dijkstra.singleSource(graph, source, (_, attr) => attr.importance);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n- **getEdgeWeight** _?string\\|function_ [`weight`]: name of the weight attribute or getter function.\n\n## A-star\n\n<h3 id=\"astar-bidirectional\">bidirectional</h3>\n\nReturns the shortest path in the weighted graph between source & target or `null` if such a path does not exist.\n\n```js\nimport {astar} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport astar from 'graphology-shortest-path/astar';\n\n// Returning the shortest path between source & target\nconst path = astar.bidirectional(\n  graph,\n  source,\n  target,\n  (_, attr) => attr.importance\n  (node, finalTarget) => euclideanDistance(points[node], points[finalTarget])\n);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **source** _any_: source node.\n- **target** _any_: target node.\n- **getEdgeWeight** _?string\\|function_ [`weight`]: name of the weight attribute or getter function.\n- **heuristic** _?function_: heuristic function to compute distance between current node and final target.\n\n## Utilities\n\n### edgePathFromNodePath\n\nHelper function that can convert a node path to an edge path.\n\n```js\nimport {edgePathFromNodePath} from 'graphology-shortest-path';\n// Alternatively, if you want to load only the relevant code\nimport {edgePathFromNodePath} from 'graphology-shortest-path/utils';\n\nconst edgePath = edgePathFromNodePath(graph, nodePath);\n```\n\n_Arguments_\n\n- **graph** _Graph_: a `graphology` instance.\n- **nodePath** _Array_: node path to convert.","users":{}}