请问如何生成一棵有根树，并以父->子的形式输出
Open
Nobody has claimed this yet.
- #135 by @weilycoder — closed without merging
- Dominant language
- Python
- Stars
- 1.7k
- Forks
- 182
- PR merge metrics
- No merged PRs in 30d
Description
就类似于[这道题](https://www.luogu.com.cn/problem/P3833)的形式输出树边。每行两个数 a,b 表示 a 是 b 的父亲。
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading issue #91 and the referenced Luogu problem to clarify the requested rooted-tree output. Then inspect linked pull request #135, including its current status, before deciding whether the request is already addressed; done should be a documented or supported way to generate the requested parent-child edge output.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100