Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:BFS
|
| gptkbp:application |
web crawling
finding connected components finding shortest path in puzzles network broadcasting |
| gptkbp:category |
uninformed search algorithm
|
| gptkbp:complexity |
O(V+E)
|
| gptkbp:contrastsWith |
depth-first search
|
| gptkbp:data_structure_used |
queue
|
| gptkbp:field |
computer science
|
| gptkbp:foundIn |
shortest path in unweighted graphs
|
| gptkbp:input |
gptkb:graph
|
| gptkbp:introduced |
gptkb:E._F._Moore
1959 |
| gptkbp:output |
traversal order
|
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:usedFor |
searching
graph traversal |
| gptkbp:bfsParent |
gptkb:Edmonds–Karp_algorithm
gptkb:Hopcroft–Karp_algorithm |
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
breadth-first search
|