algorithm - How to detect if a directed graph is cyclic?

Question

How can we detect if a directed graph is cyclic? I thought using breadth first search, but I'm not sure. Any ideas?

Answer 1

What you really need, I believe, is a topological sorting algorithm like the one described here:

http://en.wikipedia.org/wiki/Topological_sorting

If the directed graph has a cycle then the algorithm will fail.

The comments/replies that I've seen so far seem to be missing the fact that in a directed graph there may be more than one way to get from node X to node Y without there being any (directed) cycles in the graph.