Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph traversal algorithm |
| gptkbp:abbreviation |
gptkb:BFS
|
| gptkbp:appliesTo |
trees
graphs |
| gptkbp:canBe |
peer-to-peer networks
web crawling broadcasting in networks finding all nodes within one connected component finding shortest path in puzzles |
| gptkbp:category |
gptkb:search_engine
computer science graph theory |
| gptkbp:complexity |
O(V + E)
|
| gptkbp:contrastsWith |
depth-first search
|
| gptkbp:data_structure_used |
queue
|
| gptkbp:detects |
connected components
cycles in undirected graphs |
| gptkbp:firstDescribed |
gptkb:Edward_F._Moore
1959 |
| https://www.w3.org/2000/01/rdf-schema#label |
Breadth-first search
|
| gptkbp:input |
graph
|
| gptkbp:output |
distance from source to each node
order of node traversal predecessor tree |
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:usedFor |
finding shortest path in unweighted graphs
exploring all nodes in a graph |
| gptkbp:bfsParent |
gptkb:Graph_theory
|
| gptkbp:bfsLayer |
5
|