网络释义专业释义
binary rooted tree 二元有根树
ordered rooted tree 有序有根树
A deep-rooted tree is leafy 根深叶才茂
Own-rooted tree 自根树
Shallow rooted tree 浅根系大树
directed rooted tree 有向根树
-
有根树 - 引用次数：1 参考来源 - 多微网配电系统的分层孤岛运行及保护控制
-
有根图有根树
-
有根树
·2,447,543篇论文数据，部分数据来源于NoteExpress
双语例句
-
This archive was probably created as the direct (partial) image of an existing filesystem tree, and is naturally represented by the rooted tree.
该归档文件很可能创建为现有文件系统树的直接(局部)映像，所以自然可以用有根树表示。
-
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的有向树。
应用推荐