How do I check if a directed graph is acyclic? And how is the algorithm called? I would appreciate a reference.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
How do I check if a directed graph is acyclic? And how is the algorithm called? I would appreciate a reference.
I would try to sort the graph topologically, and if you can’t, then it has cycles.