What would you like to understand?

Unlike an undirected graph, a directed graph allows two oppositely directed edges between the same pair of distinct vertices. Therefore, the maximum number of edges is exactly twice the maximum number of edges in an undirected complete graph, yielding $n(n-1)$.

Conditions: G is a directed graph.; G has n vertices.; We are seeking the maximum possible number of edges.

Unlike an undirected graph, a directed graph allows two oppositely directed edges between the same pair of distinct vertices. Therefore, the maximum number of edges is exactly twice the maximum number of edges in an undirected complete graph, yielding $n(n-1)$.

Conditions: G is a directed graph.; G has n vertices.; We are seeking the maximum possible number of edges.