DFS（图论） #1189
DFS（图论）
#1189
giscus[bot]
bot
Replies: 6 comments 2 replies
-
|
时间复杂度：$O(n + m)$，我错了QwQ |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
有个问题，栈实现的for循环里面，循环入栈的时候已经把这些点访问了，这不是DFS吧。。。 |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
这是DFS，可能和您学的方式不一样 |
Beta Was this translation helpful? Give feedback.
-
MSVC怎么取消栈空间限制？ |
Beta Was this translation helpful? Give feedback.
1 reply
-
|
找到了， |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
DFS（图论）
OI Wiki 是一个编程竞赛知识整合站点，提供有趣又实用的编程竞赛知识以及其他有帮助的内容，帮助广大编程竞赛爱好者更快更深入地学习编程竞赛
https://oi-wiki.org/graph/dfs/
Beta Was this translation helpful? Give feedback.
All reactions