Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

At first glance it looks like this is very useful, but it only gives a speedup for very sparse graphs with an average degree of less than 3, unless your graph is very big, as in trillions of vertices.

This was active a couple of days ago https://news.ycombinator.com/item?id=44812695