I am learning tarjan's algorithm from here Tarjan algorithm.But I am not able to understand how we are finding strongly connected components using Stack and also Why there should be no backedge from a descendant of sub-tree rooted with V to its ancestor. In simple terms Strongly connected components forms a cycle.But without any backedge how will the cycle forms hence SCC.
Does the vertices with same low[v] values form the strongly connected components.