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? $O\left ( V+E \right )$ $O\left ( V \right )$ $O\left ( V^{2} +E \right )$ $O\left ( E\log V \right )$ Algorithms tbb-mockgate-4 algorithms graph-algorithms + – Bikram asked May 14, 2017 edited Sep 4, 2019 by Counsellor Bikram 297 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes Do a DFT or a BFT VS answered Jan 31, 2018 selected Sep 4, 2019 by Bikram VS comment Share Follow See all 0 reply Please log in or register to add a comment.