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

Can also be thought of as the number of ways of choosing pairs of nodes n choose 2 = n(n-1)/2. True if only any pair can have only one edge. Multiply by 2 otherwise