4 ms·
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
- djoldman 1y agoSo 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 1y ago[deleted]
- weebao 1y agothis'd be insane but how does it works?