Find all cycles in the directed graph?

StackOverflow https://stackoverflow.com/questions/21405321

Question

Tarjan's strongly connected components algorithm can only find fundamental cycles or all cycles that are in the graph ?

Was it helpful?

Solution

It cannot find all the cycles as long as it runs in O(V + E) (Polynomial time). If it could, it could solve hamiltonian cycle problem in polynomial time but this problem is NP-hard.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top