It is the conceptually simplest efficient algorithm .
Is not as efficient in practice as Tarjan 's strongly connected components algorithm and the path - based strong component algorithm , which perform only one traversal of the graph .
It is the conceptually simplest efficient algorithm , but is not as efficient in practice as Tarjan 's strongly connected components algorithm and the path - based strong component algorithm , which perform only one traversal of the graph .