From ffd7831defdfec87e73de6b50773dd83ab7a558a Mon Sep 17 00:00:00 2001
From: webbrain-one <295484252+webbrain-one@users.noreply.github.com>
Date: Tue, 11 Aug 2026 06:56:31 +0300
Subject: [PATCH] docs: improve README

---
 README.md | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 4704f19..05ac177 100644
--- a/README.md
+++ b/README.md
@@ -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.
@@ -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
@@ -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)
\ No newline at end of file
+- [Related Work by Duan (2018)](https://arxiv.org/abs/1808.10658)