Breadth-First Tree的意思|示意

美 / / 英 / /

广度优先树

Breadth-First Tree的网络常见释义

广度优先树 过程所产生的树称为 广度优先树 （ breadth-first tree ）。对广度优先或深度优先搜索方法稍加修改就得到连通分支算法（connectedcomponent alg .

Breadth-First Tree相关短语

1、 breadth first searching of tree 树的宽先搜索

Breadth-First Tree相关例句

A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.

提出基于单元树结构的广度优先搜索算法utbfs。

Tree breadth-first search and tree memory can be fulfilled by setting up and making access of data list in the paper.

通过建立表、访问表来实现树的存储和广度优先搜索。