知识卡片
有根树指定一个根
有根树是在自由树中指定一个根顶点;指定不同根会改变父子、深度等相对关系。
无根树的连通和无环性质仍保留。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 有根树指定一个根
原书出处 · 1 处
- 附录B 集合等离散数学基础 · 查看原书依据
A rooted tree is a free tree in which one of the vertices is distinguished from the others. We call the distinguished vertex the root of the tree. We often refer to a vertex of a rooted
参考来源
- 位置:《算法导论(第4版)》附录B《集合等离散数学基础》(OEBPS/appendix002.xhtml,文本字符[35000,40000))。
- 结论依据:附录B树的证明和定义、图着色问题;图B.6–B.8及对应公式图已查看。
- 原始内容:A rooted tree is a free tree in which one of the vertices is distinguished from the others. We call the distinguished vertex the root of the tree. We often refer to a vertex of a rooted