New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

tarjan——找出所有强连通分量 - cckk's blog~ 朝闻道，夕死可矣 #9

Open

cckk4467 opened this issue Aug 12, 2019 · 1 comment

Labels

1df63394b0cfcffa7e7fbd35644c88f4 Gitalk

Owner

cckk4467 commented Aug 12, 2019

http://cckk4467.com/articles/Orange%20Icecream/tarjan——找出所有强连通分量.html

tarjan是什么概念一种用来求解有向图所有的强连通分量的算法复杂度O(N+M) N有向图结点数 M有向图边数你需要哪些预备知识？有向图 DFS-深度优先搜索栈

cckk4467 added Gitalk 1df63394b0cfcffa7e7fbd35644c88f4 labels

Owner Author

cckk4467 commented Aug 12, 2019

欢迎反馈~

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment