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.
通过建立表、访问表来实现树的存储和广度优先搜索。
Tree breadth-first search and tree memory can be fulfilled by setting up and making access of data list in the paper.
通过建立表、访问表来实现树的存储和广度优先搜索。
应用推荐