Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
1–4 of 4 posts
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#2So 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?
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#3So 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]
Re: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
#4this'd be insane but how does it works?