Every Directed Acyclic Graph has at least one sink vertex.

Category: QuestionsEvery Directed Acyclic Graph has at least one sink vertex.
Editor">Editor Staff asked 1 month ago

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

1 Answers
Editor">Editor Staff answered 1 month ago

Right answer is (a) True
 
The best explanation: A sink vertex is a vertex which has an outgoing degree of zero.