Topic: Graph Theory Problem / Level: intermediate

Problem: Implement an algorithm to calculate the minimum number of edges to add to a directed graph to make it strongly connected.

Run the code to see the output here...