Home /
Expert Answers /
Computer Science /
what-is-the-time-complexity-of-topological-sort-assume-that-the-inputs-are-graphs-such-that-g-pa258
(Solved): What is the time complexity of Topological Sort? Assume that the inputs are graphs such that \( G= ...
What is the time complexity of Topological Sort? Assume that the inputs are graphs such that \( G=(V, E) \) with \( n=|V| \) and \( m=|E| \). Select one: a. \( \Theta(\log n) \) b. \( \Theta(n \log n) \) c. \( \Theta(n m) \) d. \( \Theta(m) \) e. \( \Theta(m \log m) \)
Expert Answer
Topological sort uses Depth First Search (DFS) with a