Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

[Ryan Hamel via NANOG <nanog () lists nanog org>]

I was scrolling LinkedIn and came across a post that mentioned a research paper: Breaking the Sorting Barrier for 
Directed Single-Source Shortest Paths

TLDR: Dijkstra got defeated after 40 years. It will be interesting to see what convergence times will look like with 
this implemented.

Different formats of the same research paper:


  *
https://arxiv.org/pdf/2504.17033
  *
https://dl.acm.org/doi/pdf/10.1145/3717823.3718179

Kind regards,

Ryan Hamel

_______________________________________________
NANOG mailing list 
https://lists.nanog.org/archives/list/nanog () lists nanog org/message/RPNTZTJEGQJ6WMI4AKOFUUOVFP4CP7AC/