from Hacker News

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

by mahmoudimus on 5/29/25, 3:43 AM with 2 comments

• by djoldman on 5/29/25, 11:06 AM

  So for a directed graph with positive weights, this beats Dijkstra!? This would be an amazing result, right?

  Or is this one of those Algorithms that is only meaningful with impractically small, large, or weird data?

• by weebao on 5/30/25, 5:35 AM

  this'd be insane but how does it works?