Vidyalelo
Data Structure · Q142

Graphs

Programming · Data Structure · question 142

Q142

The topological sorting of any DAG can be done in . . . . . . . . time.

A.
cubic
B.
quadratic
C.
linear
Answer
D.
logarithmic

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board