With Vgreater Than 1 Vertices How Many Edges At Most Can A #1258
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 Graph - Directed Acyclic Graph - Quiz No.1.
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
(V*(V-1))/2
(V*(V+1))/2
(V+1)C2
(V-1)C2
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
