A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, 1983.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

P. Lammich, Verified Efficient Implementation of Gabow???s Strongly Connected Component Algorithm, pp.325-340, 2014.
DOI : 10.1007/978-3-319-08970-6_21

R. Neumann, A framework for verified depth-first algorithms, ATx/WInG: Joint Proceedings of the Workshops on Automated Theory eXploration and on Invariant Generation, pp.36-45, 2012.

F. Pottier, Depth-first search and strong connectivity in Coq, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01096354

M. Sharir, A strong-connectivity algorithm and its applications in data flow analysis, Computers & Mathematics with Applications, vol.7, issue.1, pp.67-72, 1981.
DOI : 10.1016/0898-1221(81)90008-0

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

I. Wegener, A simplified correctness proof for a well-known algorithm computing strongly connected components, Information Processing Letters, vol.83, issue.1, pp.17-19, 2002.
DOI : 10.1016/S0020-0190(01)00306-4