Welcome to breaking-the-sorting-barrier Discussions!

[chethandvg]

Hi! This repository is a C# implementation of the BMSSP algorithm from the STOC 2025 paper
"Breaking the Sorting Barrier for Directed Single-Source Shortest Paths" by Duan, Mao, Mao, Shu, Yin.

What you'll find here:

• Full BMSSP implementation with 97 tests
• Side-by-side comparison against Dijkstra
• Benchmarks up to 1,000,000 vertices

Feel free to:

• 🤔 Ask questions about the algorithm or implementation
• 💡 Suggest improvements or optimizations
• 🐛 Report bugs or correctness issues
• 📊 Share your own benchmark results

If you're new to the paper, start with results/verdict-explained.md
for a beginner-friendly explanation.