What is the maximum number of edges in a directed graph with n nodes?

Question

What is the maximum number of edges in a directed graph with n nodes? Is there any upper bound?

Answer 1

The correct answer is n*(n-1)/2. Each edge has been counted twice, hence the division by 2. A complete graph has the maximum number of edges, which is given by n choose 2 = n*(n-1)/2.