Conceptadvanced
Sorting barrier for SSSP
Also called Dijkstra sorting barrier.
The long-standing bound that comparison-based Dijkstra-style methods need roughly sorting time, which later work beat for directed graphs.
The long-standing bound that comparison-based Dijkstra-style methods need roughly sorting time, which later work beat for directed graphs.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag WDGRCA Edit this page History Report an error