endlessly rooted tree [计] 无端标定树 ; 无端有根树
identity rooted tree 么有根树 ; 么有限树
binary rooted tree 二元有根树
ordered rooted tree 有序有根树
A deep-rooted tree is leafy 根深叶才茂
Own-rooted tree 自根树
orderd rooted tree 有序有根树
Shallow rooted tree 浅根系大树
·2,447,543篇论文数据，部分数据来源于NoteExpress
The result graph is then a rooted tree.
得到的结果就是有根树。
A directed rooted tree refers to a directed tree which has one vertex with out-degree 0 and all the other vertices with out-degree 1.
有向根树就是只有一个顶点的出度为0，其余顶点的出度均为1的有向树。
It is proved that the R-rotation graph of a elementary coronoid system is a multiple directed rooted tree containing at least 2 trees.
如果冠状系统是基本的，已经证明其R -旋转图至少包含2棵有向根树。
应用推荐