Breaking the Sorting Barrier for Directed Single-Source Shortest Paths(arxiv.org)17 points·by mahmoudimus·anno scorso·2 commentsarxiv.orgBreaking the Sorting Barrier for Directed Single-Source Shortest Pathshttps://arxiv.org/abs/2504.170332 commentsPost comment[–]djoldman·anno scorsoreplySo 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?[+][deleted]·anno scorso[–]weebao·anno scorsoreplythis'd be insane but how does it works?
Or is this one of those Algorithms that is only meaningful with impractically small, large, or weird data?