{"_id":"@codeclever/duan-sssp","_rev":"7-a7b407416883f22e6cb399e02a886e81","name":"@codeclever/duan-sssp","dist-tags":{"latest":"1.2.0"},"versions":{"1.0.0":{"name":"@codeclever/duan-sssp","version":"1.0.0","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.0.0","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"16b4fb42c498a611c98364955c6dee70ab7ec5c5","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.0.0.tgz","fileCount":7,"integrity":"sha512-CGT2Icttl9uZis0W9Uq0M5Z8WaontexngcHgrsBjB8vL6nLNCthYP8k0VFJZfkiTg/1Q3sibiEJXto8GrG3zIw==","signatures":[{"sig":"MEQCICNLOtrO2Pl/1rIeIvIb5vG3/O3ih4KGQWlq5Kj6txT2AiBg5QbFCWfUnXv3DetLeNB1xKs45QkAmHEjYjclbp+bCQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":24165},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.0.0_1758706138470_0.5881240219195856","host":"s3://npm-registry-packages-npm-production"}},"1.0.1":{"name":"@codeclever/duan-sssp","version":"1.0.1","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.0.1","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"0a8da6236605a7883e565162b4a68d8ef0732453","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.0.1.tgz","fileCount":4,"integrity":"sha512-Uu7axn8DEpCKRoX27uw8y7vQo4hA6oVHs9ssf+jUrP2v6Zi6MJS0ZTy4MopHgAWa7bTuCA9EN8kYth5FAQ0jAw==","signatures":[{"sig":"MEYCIQCmsSXrVbvlHSUEv993IGq7mWlViq03enes1mtrhcCpXwIhALEr4RYsu1yYVMM1Sj0XjtdfNDuTjsetPQRFflVzoRi0","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":17629},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.0.1_1758706404236_0.561282245588028","host":"s3://npm-registry-packages-npm-production"}},"1.0.2":{"name":"@codeclever/duan-sssp","version":"1.0.2","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.0.2","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"08fef869128167de5656b93754b04901914b8d11","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.0.2.tgz","fileCount":4,"integrity":"sha512-7lVgO+Jo51DXYHTBMyaWhQ25h+MDMeNUdEUhuIDJPoSn1PYIab1y2+p62MzOXDGAzWEe9jM/fkgC2b6fM5ae6Q==","signatures":[{"sig":"MEYCIQD1J6BfWQhZlFngoSGORKg9PGPL/rvriz8visseS0gb6gIhALSLdDS3WBXWyzf/tg6RttIqq3T1UsX9ClpTGvjeua9M","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":17632},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.0.2_1758706549240_0.06694077665387055","host":"s3://npm-registry-packages-npm-production"}},"1.0.8":{"name":"@codeclever/duan-sssp","version":"1.0.8","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.0.8","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"90aae4b4be01d3106bce7a913e16a7097a95f53e","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.0.8.tgz","fileCount":4,"integrity":"sha512-8bpG2V6Fpbxm0i1QJYGt5IkTddolYpPx8nvNKtDTfykYHWHhZ6t7/EXtWQle/Zw55q5gSblrnWH90IfNq479NA==","signatures":[{"sig":"MEQCIF3CVF2B5iKglB2/K/ybntyOceUBYSl7kbTVE/NuHCeTAiA8SMM3YE7g/C5pLhhKD4nWg7fH8fc05KO/4Mfv22iAQg==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":17565},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.0.8_1758706777248_0.5097647423286353","host":"s3://npm-registry-packages-npm-production"}},"1.0.9":{"name":"@codeclever/duan-sssp","version":"1.0.9","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.0.9","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"761490f3edebdc423d5792c7ff1c17fb2c645ffd","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.0.9.tgz","fileCount":4,"integrity":"sha512-FjK9LtuoTifhLO7wPgc/1LYAAaQGQUFVpCyzeVSrejYjMZnWpDXJ+h9xRhZOp2gZdLXryRX59D5maxux4aB16w==","signatures":[{"sig":"MEQCIDB1R5HZsc+X+MWfA1ewJJZoBd+Ot7F01/rlJ8itVEg+AiAaJx5dB8/SCj5VsqFA5ugttJValzmlsAFO+WkfHFMnCQ==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":17551},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.0.9_1758707106335_0.12985485820564313","host":"s3://npm-registry-packages-npm-production"}},"1.1.0":{"name":"@codeclever/duan-sssp","version":"1.1.0","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","_id":"@codeclever/duan-sssp@1.1.0","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"dist":{"shasum":"83e49cbbcb2899e31a003a078e070cb90314fd79","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.1.0.tgz","fileCount":4,"integrity":"sha512-77xi1KOfkHD/zrNjeRGwkLdqFwSDXqQdWOb33T9In5aELRKgIvOcIgI1qy1YQKokRDLUfpD0Bl4KO7rbhVkhXw==","signatures":[{"sig":"MEUCIQC5nlxfb7M6jYYVCUdqtAhBmKr2IUq8OyERPfgcz6lLqAIgPMJZRxeOneu/dRPZDDK0cTbCscVuPJznS0DwlrJZjow=","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"unpackedSize":17551},"main":"duan-sssp.js","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"_npmVersion":"10.8.2","description":"NPM package for Duan's algorithm for single source shortest path problem","directories":{},"_nodeVersion":"20.19.4","_hasShrinkwrap":false,"_npmOperationalInternal":{"tmp":"tmp/duan-sssp_1.1.0_1758707150949_0.5054980994833524","host":"s3://npm-registry-packages-npm-production"}},"1.2.0":{"name":"@codeclever/duan-sssp","version":"1.2.0","main":"duan-sssp.js","type":"module","scripts":{"test":"echo \"Error: no test specified\" && exit 1","start":"node duan-sssp.js"},"keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"author":{"name":"CodeClever"},"license":"MIT","description":"NPM package for Duan's algorithm for single source shortest path problem","repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"homepage":"https://github.com/CodeCleverOG/Duan-SSSP","dependencies":{"@codeclever/duan-sssp":"^1.1.0"},"_id":"@codeclever/duan-sssp@1.2.0","bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"_nodeVersion":"20.19.4","_npmVersion":"10.8.2","dist":{"integrity":"sha512-TjYccY4FIMbLKc5qutzU6MVYSe4suDa5E4JK87YVpH4/Z/yTyYMIlTW2mlTzUY3nXz9qla3WPHU9I4w2j7dGpA==","shasum":"449afefb9daa630401a73bf77f32385ab27fa187","tarball":"https://registry.npmjs.org/@codeclever/duan-sssp/-/duan-sssp-1.2.0.tgz","fileCount":4,"unpackedSize":17658,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEQCIEHRjJyUP1qpeW8ZPMPSwvReZdNhHu/qG6C6+xWaRjSaAiB+HUo5oKqaEgqLIe6sS6MN0lPfxU6F+4kiOxNk9lK4Og=="}]},"_npmUser":{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"},"directories":{},"maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/duan-sssp_1.2.0_1758804601149_0.3099507831081889"},"_hasShrinkwrap":false}},"time":{"created":"2025-09-24T09:28:58.342Z","modified":"2025-09-25T12:50:01.526Z","1.0.0":"2025-09-24T09:28:58.684Z","1.0.1":"2025-09-24T09:33:24.443Z","1.0.2":"2025-09-24T09:35:49.463Z","1.0.8":"2025-09-24T09:39:37.398Z","1.0.9":"2025-09-24T09:45:06.502Z","1.1.0":"2025-09-24T09:45:51.120Z","1.2.0":"2025-09-25T12:50:01.329Z"},"bugs":{"url":"https://github.com/CodeCleverOG/Duan-SSSP/issues"},"author":{"name":"CodeClever"},"license":"MIT","homepage":"https://github.com/CodeCleverOG/Duan-SSSP","keywords":["Single Source Shortest Path","Duan's Algorithm","Graph Algorithms","CodeClever"],"repository":{"url":"git+https://github.com/CodeCleverOG/Duan-SSSP.git"},"description":"NPM package for Duan's algorithm for single source shortest path problem","maintainers":[{"name":"qandeelabbassi","email":"qandeel@codeclever.tech"}],"readme":"# duan-sssp\r\n\r\nDeterministic O(m \\* log^(2/3) n) directed Single-Source Shortest Path (SSSP) algorithm implementation in JavaScript.\r\n\r\nAuthor: CodeClever\r\n\r\n## Install\r\n\r\nnpm:\r\n\r\n```\r\nnpm install @codeclever/duan-sssp\r\n\r\n```\r\n\r\n## Usage\r\n\r\n```js\r\nconst { Graph } = require(\"@codeclever/duan-sssp\");\r\n\r\nconst graph = new Graph(4);\r\ngraph.addEdge(0, 1, 2);\r\ngraph.addEdge(0, 2, 5);\r\n\r\ngraph.addEdge(1, 2, 1);\r\ngraph.addEdge(1, 3, 2);\r\ngraph.addEdge(2, 3, 1);\r\n\r\n// Get full shortest path\r\nconst path = graph.getPath(0, 3); // Returns [0, 1, 3]\r\n\r\nconsole.log(\"shortest path\", path);\r\n```\r\n\r\n## License\r\n\r\nThis project is published under MIT License.\r\n","readmeFilename":"README.md"}