Request New Subject
Home
Data Structures (DS)
Non Linear Data Structures - Graphs
Q. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess? (Solved)
1. (V*(V-1))/2
2. (V*(V+1))/2
3. (V+1)C2
4. (V-1)C2
a. (V*(V-1))/2
Related Topics
→ Linear Data Structures -Stacks and Queues
→ Non Linear Data Structures - Trees
→ Searching, Sorting and Hashing Techniques
Subscribe Now
Get All Updates & News
Subscribe