Given a connect Directed Graph, find the minimum number of edge required to make every vertex reachable from each other, the condition given that you can only add edge u to v if there is an edge from v to u already exist.