CareerCup

Yes!

won't dfs traversal use a loop.. we shoudn't be looping..

dfs use loop??what that means?

I mean for dfs u would make use of a for or while loop, the question says that we shouldn't use loops..

dfs wont work
for eg.

dfs wont work always
for eg.
take task A,B,C and D
let B and C depends on A and D depends on D(construct the graf)
using dfs D can be completed directly through A,B and D...therefor leaving task C behing

topological sort is best to use

@krithick.krishnagiri No loops in the question means that there are no cyclic dependencies between the tasks. It does not that a loop cannot be used in the answer

@bibhay ranjan: i said 'until all elements are visited' meaning u should start dfs again from the next unvisited node and continue this way until all are visited.Infact dfs is a way to do topological sort.google topological sort and see the 2nd link