|
gptkbp:instanceOf
|
gptkb:algorithm
graph traversal algorithm
|
|
gptkbp:abbreviation
|
gptkb:BFS
|
|
gptkbp:appliesTo
|
trees
graphs
|
|
gptkbp:can_be_implemented_using
|
adjacency matrix
adjacency list
|
|
gptkbp:canBe
|
peer-to-peer networks
web crawling
solving puzzles
finding connected components
|
|
gptkbp:category
|
gptkb:artificial_intelligence
gptkb:search_engine
computer science
|
|
gptkbp:complexity
|
O(V + E)
|
|
gptkbp:contrastsWith
|
gptkb:Depth-First_Search
|
|
gptkbp:data_structure_used
|
queue
|
|
gptkbp:explores
|
neighbors before children
|
|
gptkbp:firstDescribed
|
gptkb:Edward_F._Moore
|
|
gptkbp:guarantees
|
shortest path in unweighted graphs
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Breadth-First Search
|
|
gptkbp:input
|
graph
starting node
|
|
gptkbp:introducedIn
|
1959
|
|
gptkbp:output
|
distance from source to each node
order of node traversal
|
|
gptkbp:relatedTo
|
gptkb:A*_search
gptkb:Dijkstra's_algorithm
|
|
gptkbp:spaceComplexity
|
O(V)
|
|
gptkbp:usedFor
|
finding shortest path in unweighted graphs
exploring all nodes in a graph
|
|
gptkbp:bfsParent
|
gptkb:Graph_Algorithms
gptkb:BFS
gptkb:Nvidia_cuGraph
|
|
gptkbp:bfsLayer
|
6
|