If you are an undergrad looking for a cool research project in DS&A, consider implementing the new O(E * (log V)^0.67)-time algorithm for shortest paths, and comparing it experimentally with Dijkstra.

The original paper has no experimental results. It has pseudocode, but it is purely theoretical.

It's likely that nobody has implemented this algorithm yet -- you could be the first!

Everyone expects Dijkstra to outperform it in practice, even for sparse graphs, but it would be cool to see by how much.

I don't know if it would be *publishable* in a peer-reviewed conference, but I think it would be a great undergrad thesis or something like that.