Topic: Graph Theory Problem / Level: advanced

Problem: Write a program to check if a directed graph can be made strongly connected by removing edges.

Run the code to see the output here...