InterviewSolution
Saved Bookmarks
| 1. |
What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?(a) Depends on a Graph(b) Will always be zero(c) Will always be greater than zero(d) May be zero or greater than zeroThe above asked question is from Directed Acyclic Graph topic in section Graph of Data Structures & Algorithms II have been asked this question during an internship interview. |
|
Answer» CORRECT answer is (B) Will always be zero Explanation: EVERY Directed Acyclic Graph has a source and a sink vertex. |
|