12.1 Definition and terminologies In a directed graph with n nodes, the number of edges <=n (n-1).If=is satisfied, then it is called a complete directed graph12.1 Definition and terminologies In a directed graph with n nodes, the number of edges <=n*(n-1). If “=“ is satisfied, then it is called a complete directed graph