Hey babe, wake up, new Dijkstra's just dropped
Deedy
Deedy23 tuntia sitten
Huge computer science result: A Tsinghua professor JUST discovered the fastest shortest path algorithm for graphs in 40yrs. This improves on Turing award winner Tarjan’s O(m + nlogn) with Dijkstra’s, something every Computer Science student learns in college.
5,77K