We present an analysis of the depth-first search algorithm in a random digraph model with geometric outdegree distribution. This problem posed by Don Knuth in his next to appear volume of The Art of Computer Programming gives interesting insight in one of the most elegant and efficient algorithm for graph analysis due to Tarjan.