+1 vote
in Data Structures & Algorithms I by (88.2k points)
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

(a) (V*(V-1))/2

(b) (V*(V+1))/2

(c) (V+1)C2

(d) (V-1)C2

Enquiry is from Directed Acyclic Graph topic in division Graph of Data Structures & Algorithms I

The question was posed to me during an interview for a job.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
The correct answer is (a) (V*(V-1))/2

Easiest explanation - The first edge would have an outgoing degree of atmost V-1, the next edge would have V-2 and so on, hence V-1 + V-2…. +1 equals (V*(V-1))/2.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.