The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.

针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。

youdao

In the world of the internet, operators are looking at ways of marrying up the algorithms that find the shortest path through a network and those that control the speed with which information flows.

ECONOMIST: Algorithms