Skip to content

docs: improve README #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
webbrain-one wants to merge 1 commit into
base: main
Choose a base branch
from
Open

docs: improve README #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 5 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,5 @@


# Breaking the Sorting Barrier: Shortest Path Algorithm Implementation

Implementation of the groundbreaking 2024-2025 shortest path algorithm by Ran Duan et al. that breaks the 40-year-old sorting barrier, achieving O(m log^(2/3) n) time complexity for directed graphs with non-negative weights.
Expand Down Expand Up @@ -25,8 +27,8 @@ This repository provides a comprehensive implementation of the algorithm describ

```bash
# Clone the repository
git clone https://github.com/yourusername/shortest-paths.git
cd shortest-paths
git clone https://github.com/arman0z/shortest-path-algorithm.git
cd shortest-path-algorithm

# Install dependencies
pip install -r requirements.txt
Expand Down Expand Up @@ -148,4 +150,4 @@ MIT License - See [LICENSE](LICENSE) file for details.
- [New Method Is the Fastest Way To Find the Best Routes (2025)](https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/)
- [Original Paper (2025)](https://arxiv.org/abs/2504.17033)
- [Undirected Algorithm (2023)](https://arxiv.org/abs/2307.04139)
- [Related Work by Duan (2018)](https://arxiv.org/abs/1808.10658)
- [Related Work by Duan (2018)](https://arxiv.org/abs/1808.10658)