Breaking the Sorting Barrier

Dijkstra vs Tsinghua SSSP

Algorithms

Dijkstra (1956)

O(m + n log n)

Tsinghua SSSP (2025)

O(m log²/³ n) — Tsinghua

Time Comparison

Dijkstra

—

Tsinghua

—

Operations

Dijkstra

Tsinghua

How to use:
1. Click anywhere on the map to set Start (green)
2. Click again to set End (red)
3. Click Race! to compare algorithms
4. Zoom and pan the map freely

Legend

Start Point

End Point

Dijkstra Path

Tsinghua Path

0 nodes · 0 edges (generated grid)