algorithm - How do I check if a directed graph is acyclic?

Question

How do I check if a directed graph is acyclic? And how is the algorithm called? I would appreciate a reference.

Answer 1

I would try to sort the graph topologically, and if you can't, then it has cycles.