Topic: Graph Theory Problem / Level: intermediate

Problem: Implement an algorithm to find the minimum number of edges required to make a directed graph strongly connected.

Run the code to see the output here...