Breadth -first search (BFS) is a strategy for searching in a graph.The BFS begins at a root node and inspects all the neighboring nodes.
確定! 回上一頁