Question
For a directed graph with n vertices maximum no. of possible edges is:
For a directed graph with n vertices maximum no. of possible edges is:
Answer: Option D
Was this answer helpful ?
If you have N nodes, there are N - 1 directed edges than can lead from it (going to every other node). Therefore, the maximum number of edges is N * (N - 1).
Was this answer helpful ?
More Questions on This Topic :
Question 8.
Recursion is preferred in most algorithms:
....
Submit Solution