はばゆうせんたんさく
幅優先探索
1. breadth-first searchComputing
2. Breadth-first searchIn graph theory, breadth-first search (BFS) is a strategy for searching in a graph when search is limited to essentially two operations: (a) visit and inspect a node of a graph; (b) gain access to visit the nodes that neighbor the currently visited node. The BFS begins at a root node and inspect all the neighboring nodes. Then for each of those neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on. Compare it with the depth-first search.
Read “Breadth-first search” on English Wikipedia
Read “幅優先探索” on Japanese Wikipedia
Read “Breadth-first search” on DBpedia
Read “Breadth-first search” on English Wikipedia
Read “幅優先探索” on Japanese Wikipedia
Read “Breadth-first search” on DBpedia
Discussions
Log in to talk about this word.