breadth first search

基本解释

The second algorithm is also derived from the breadth-first search method.
第二个算法也是基于广度优先搜索策略。
The final result of parsing is the parse tree with the largest probability searched with Breadth-first search(BFS).
采取BFS算法高效搜索概率值最高的候选句法树作为最终的句法分析结果。
Tree breadth-first search and tree memory can be fulfilled by setting up and making access of data list in the paper.
通过建立表、访问表来实现树的存储和广度优先搜索。