#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?

Question

I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time, but I can't be able find that algorithm. Someone please share that.

Comments

@iarnav , Cheriyan-Mehlhorn and Gabow has given a one pass Linear time algorithm to find the strongly connected component in a directed graph after Tarjan(Linear-time algo) and Kosaraju-Sharir(two pass Linear time algo).  Just search on google with the given name. you will get it.

---

@ankitgupta.1729 Thank you, Ankit.