Sail E0 Webinar
Question

For a directed graph with n vertices maximum no. of possible edges is:



Options:
A .  n^2
B .  n(n-1)/2
C .  n(n+1)/2
D .  n(n-1)
Answer: Option D

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 ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers