Meet the concept↗
A strongly connected directed graph with n vertices has at least n edges. This minimum is achieved when the graph forms a single directed cycle.
Conditions: The graph is directed.; The graph is strongly connected.; The graph has n vertices.
7:06 – 7:23Watch this moment ↗
A strongly connected directed graph with n vertices has at least n edges. This minimum is achieved when the graph forms a single directed cycle.
Conditions: The graph is directed.; The graph is strongly connected.; The graph has n vertices.
7:06 – 7:23Watch this moment ↗