directed 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棵有向根树。
应用推荐