MadeEasy CBT 2017: Algorithms - Graph Algorithms

Question

Answer 1

I think running Depth First Search will be enough to calculate the depth of The DAG

so complexity O(V+E)

so b shouldd be correct

Comments

what about undirected graph??then also we can do BFS or DFS righht??i guess BFS would be more preferrable

---

same for undirected graphs

---

Question asked for worst case not best case.