@dave_andersen@hachyderm.io @SystemsAppr@discuss.systems Very true. I have seen "text book" examples of implementing Dijkstra's shortest path that were actually O(N^2)... And, no, I was not trying to dis math. That paper is definitely interesting, even if they did not do the best job about modestly acknowledging limitations. Which student does that?