edited by
297 views
3 votes
3 votes

What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges?

  1. $O\left ( V+E \right )$
  2. $O\left ( V \right )$
  3. $O\left ( V^{2} +E \right )$
  4. $O\left ( E\log V \right )$
edited by

1 Answer

Best answer
3 votes
3 votes
Do a DFT or a BFT
selected by
Answer:

Related questions