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

Question

asked Oct 17, 2021 in Technique[技术] by 深蓝 (71.8m points)

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

See Question&Answers more detail:os

与恶龙缠斗过久,自身亦成为恶龙；凝视深渊过久,深渊将回以凝视…

1.1k views

1 Answer

深蓝 · Answer 1 · 2021-10-16T23:50:15+0000

answered Oct 17, 2021 by 深蓝 (71.8m points)

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

与恶龙缠斗过久,自身亦成为恶龙；凝视深渊过久,深渊将回以凝视…