first release

Author: qandeelabbassi

.gitignore

@@ -0,0 +1,143 @@
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+lerna-debug.log*
+
+# Diagnostic reports (https://nodejs.org/api/report.html)
+report.[0-9]*.[0-9]*.[0-9]*.[0-9]*.json
+
+# Runtime data
+pids
+*.pid
+*.seed
+*.pid.lock
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+*.lcov
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (https://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# Bower dependency directory (https://bower.io/)
+bower_components
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (https://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules/
+jspm_packages/
+
+# Snowpack dependency directory (https://snowpack.dev/)
+web_modules/
+
+# TypeScript cache
+*.tsbuildinfo
+
+# Optional npm cache directory
+.npm
+
+# Optional eslint cache
+.eslintcache
+
+# Optional stylelint cache
+.stylelintcache
+
+# Optional REPL history
+.node_repl_history
+
+# Output of 'npm pack'
+*.tgz
+
+# Yarn Integrity file
+.yarn-integrity
+
+# dotenv environment variable files
+.env
+.env.*
+!.env.example
+
+# parcel-bundler cache (https://parceljs.org/)
+.cache
+.parcel-cache
+
+# Next.js build output
+.next
+out
+
+# Nuxt.js build / generate output
+.nuxt
+dist
+.output
+
+# Gatsby files
+.cache/
+# Comment in the public line in if your project uses Gatsby and not Next.js
+# https://nextjs.org/blog/next-9-1#public-directory-support
+# public
+
+# vuepress build output
+.vuepress/dist
+
+# vuepress v2.x temp and cache directory
+.temp
+.cache
+
+# Sveltekit cache directory
+.svelte-kit/
+
+# vitepress build output
+**/.vitepress/dist
+
+# vitepress cache directory
+**/.vitepress/cache
+
+# Docusaurus cache and generated files
+.docusaurus
+
+# Serverless directories
+.serverless/
+
+# FuseBox cache
+.fusebox/
+
+# DynamoDB Local files
+.dynamodb/
+
+# Firebase cache directory
+.firebase/
+
+# TernJS port file
+.tern-port
+
+# Stores VSCode versions used for testing VSCode extensions
+.vscode-test
+
+# yarn v3
+.pnp.*
+.yarn/*
+!.yarn/patches
+!.yarn/plugins
+!.yarn/releases
+!.yarn/sdks
+!.yarn/versions
+
+# Vite files
+vite.config.js.timestamp-*
+vite.config.ts.timestamp-*
+.vite/
+
+.DS_Store

CODE_OF_CONDUCT.md

@@ -0,0 +1,29 @@
+# Code of Conduct
+
+This repository ("duan-ssp") implements the Duan et al. directed SSSP algorithm. All contributors, maintainers, and participants are expected to follow this Code of Conduct.
+
+## Expected behavior
+
+- Be respectful, constructive and professional.
+- Report bugs, propose changes, and ask questions politely.
+- Attribute ideas and follow licensing requirements.
+
+## Unacceptable behavior
+
+- Harassment, abusive language, hate speech, threats, or doxxing.
+- Abusive comments, repeated unwanted contact, or offensive images.
+- Publicly sharing private or sensitive information about others.
+
+## Reporting
+
+If you experience or witness unacceptable behavior, open an issue labeled `conduct` or contact the maintainers via the repository issue tracker with relevant details. Reports will be treated confidentially when possible.
+
+## Enforcement
+
+Maintainers may remove content, close issues or PRs, issue warnings, or block accounts at their discretion to maintain a safe and productive project.
+
+## Scope
+
+Applies to all project spaces (issues, pull requests, discussions, code, and community channels) and contributors representing the project externally.
+
+Thank you for helping keep this project welcoming and productive.

README.md

@@ -0,0 +1,37 @@
+# duan-sssp
+
+Deterministic O(m \* log^(2/3) n) directed Single-Source Shortest Path (SSSP) algorithm implementation in JavaScript.
+
+Author: CodeClever
+
+## Install
+
+npm:
+
+```
+npm install duan-sssp
+
+```
+
+## Usage
+
+```js
+const { Graph } = require("duan-sssp");
+
+const graph = new Graph(4);
+graph.addEdge(0, 1, 2);
+graph.addEdge(0, 2, 5);
+
+graph.addEdge(1, 2, 1);
+graph.addEdge(1, 3, 2);
+graph.addEdge(2, 3, 1);
+
+// Get full shortest path
+const path = graph.getPath(0, 3); // Returns [0, 1, 3]
+
+console.log("shortest path", path);
+```
+
+## License
+
+This project is published under MIT License.