What is the maximum number of edges in a directed graph with n nodes? Is there any upper bound?
In a directed graph having N vertices, each vertex can connect to N-1 other vertices in the graph(Assuming, no self loop). Hence, the total number of edges can be are N(N-1).