我如何检查是否有向图是无环？ [英] How do I check if a directed graph is acyclic?
本文介绍了我如何检查是否有向图是无环？的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！
问题描述
我如何检查是否有向图是无环？而且怎么叫算法？我想AP preciate一个参考。
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.
这篇关于我如何检查是否有向图是无环？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
查看全文
