In directed graph, to find strongly connected components why do we have to transpose adjacency matrix (reverses the direction of all edges) if we could use reversed list of nodes by they finishing time and then traverse original graph.In other words, we would find finish times of all vertices and start traversing from lowest finish time to greatest (by increasing finish time)? Additionally, if we do topological sorting on some DAG, and then reverse edges (transpose adjacency matrix) and do topological sorting again - should we get to equal arrays, just in reversed order?EDIT:Algorithm description from other topic:Correctness of Strongly Connected Components algorithm for a directed graph
Kosarajus Algorithm - why transpose?
algorithms;graphs