Hi,

by the way DFS has linear growth ( O(n) ), meaning that it is pretty efficient.

I believe that there is no faster algorithm for your problem, in terms of efficiency.

Hi,

I wonder why people think about graphics applications when they read "directed graph". Actually, it is clearly defined what that means.

However, you can detect cycles in directed graphs by...