0 votes 0 votes 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. Algorithms graph-theory algorithms depth-first-search graph-algorithms + – iarnav asked May 13, 2018 • recategorized Jul 6, 2022 by Lakshman Bhaiya iarnav 419 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply ankitgupta.1729 commented Jul 20, 2018 reply Follow Share @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. 1 votes 1 votes iarnav commented Jul 20, 2018 reply Follow Share @ankitgupta.1729 Thank you, Ankit. 1 votes 1 votes Please log in or register to add a comment.
