Topic: Language Problem / Level: advanced

Problem: Write a program to find all strongly connected components in a directed graph using Tarjan’s algorithm.

Run the code to see the output here...