Topic: Graph Theory Problem / Level: intermediate

Problem: Implement an algorithm to check if a directed graph is strongly connected using the Tarjan’s algorithm.

Run the code to see the output here...