What would you like to understand?

To ensure mutual reachability between every pair of vertices, the directed graph must contain at least one directed cycle that covers all n vertices. A directed cycle with n vertices has exactly n edges, which is the minimum required for strong connectivity.

Conditions: G is a directed graph.; G has n vertices.; G is a strongly connected graph.

To ensure mutual reachability between every pair of vertices, the directed graph must contain at least one directed cycle that covers all n vertices. A directed cycle with n vertices has exactly n edges, which is the minimum required for strong connectivity.

Conditions: G is a directed graph.; G has n vertices.; G is a strongly connected graph.