同年他写了一篇叫《Depth-First Search and Linear Graph Algorithms》的论文，用深度优先搜索把几个经典的图论问题做到了线性时间。今天信奥课程里的Tarjan强连通分量算法，就出自这里。

JOHN Edward Hopcroft, a name etched in the annals of computer science history, is far more than simply a recipient of the ACM A.M.Turing Award, better known as the "Nobel Prize for Computing." He is a ...