Tsinghua That’s it. That’s the tweet.
Deedy
Deedy8.8. klo 23.30
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.
311