Which cycle detection within a directed graph are more efficient than O(n^2)? [closed]

Tarjan’s strongly connected components algorithm has O(|E| + |V|) time complexity.

For other algorithms, see Strongly connected components on Wikipedia.