Skip to content
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

请问如何生成一棵有根树，并以父->子的形式输出 #91

Open
nalemy opened this issue Aug 22, 2021 · 2 comments · May be fixed by #135
Open

请问如何生成一棵有根树，并以父->子的形式输出 #91

nalemy opened this issue Aug 22, 2021 · 2 comments · May be fixed by #135

Comments

@nalemy
Copy link

nalemy commented Aug 22, 2021

就类似于这道题的形式输出树边。每行两个数 a,b 表示 a 是 b 的父亲。
@nalemy
Copy link
Author

nalemy commented Aug 22, 2021

能不能有除了dfs一遍以外的其他方法？

@CUICUI2010
Copy link

Cu Ball

@weilycoder weilycoder linked a pull request Oct 3, 2024 that will close this issue
Open
@Mr-Python-in-China Mr-Python-in-China linked a pull request Oct 5, 2024 that will close this issue
add spanning tree #135
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

add spanning tree weilycoder/cyaron
2 participants
@nalemy @CUICUI2010