We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
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
https://oi-wiki.org/graph/dominator-tree/#%E6%95%B0%E6%8D%AE%E6%B5%81%E8%BF%AD%E4%BB%A3%E6%B3%95
您好,我在学习这一章内容时,发现它提到了“深度有限排序”这个词,但是其他地方都没有介绍它的内容。请问能否提供一下这个词的介绍链接或者是英文翻译,谢谢!
The text was updated successfully, but these errors were encountered:
感谢你对 OI Wiki 的关注!记得在 Issue 中表达清楚自己的意思哦~
Sorry, something went wrong.
估计是typo了?是不是深度优先排序
怀疑是,不太敢确定,因为不知道深度优先排序能不能得到逆后序
我的锅, 确实是 typo, 明天改一下
OK
Successfully merging a pull request may close this issue.
请选择:
我正在访问这个页面
https://oi-wiki.org/graph/dominator-tree/#%E6%95%B0%E6%8D%AE%E6%B5%81%E8%BF%AD%E4%BB%A3%E6%B3%95
我发现页面有这样的问题
您好,我在学习这一章内容时,发现它提到了“深度有限排序”这个词,但是其他地方都没有介绍它的内容。请问能否提供一下这个词的介绍链接或者是英文翻译,谢谢!
The text was updated successfully, but these errors were encountered: