1.

Every Directed Acyclic Graph has at least one sink vertex.(a) True(b) FalseQuery is from Directed Acyclic Graph in section Graph of Data Structures & Algorithms II have been asked this question in homework.

Answer» RIGHT answer is (a) True

The best explanation: A sink vertex is a vertex which has an OUTGOING degree of ZERO.


Discussion

No Comment Found

Related InterviewSolutions