Directed Acyclic Graph

Any Directed Acyclic Graph must have:

(A) At least one vertex with indegree 1 and at least one vertex with outdegree 0
(B) At least one vertex with indegree 0 or at least one vertex with outdegree 0
(C) At least one vertex with indegree 0 and at least one vertex with outdegree 0
(D) At least one vertex with indegree 0 and at least one vertex with outdegree 1

Why option c is correct

2Comments
Mayuri SIngh Rajput @elixir 7 Nov 2015 10:11 pm

Any acyclic directed graph will satisfy option 'c', i.e. atleast one vertex would have indegree zero ( for eg. tree with root as starting vertex) and atleast one vertex with out degree zero (all leaves of the tree).  

hero_cs @hero_cs 7 Nov 2015 11:32 pm
Ok ..thanku

Pages