Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:canBe |
finding connected components
finding shortest path in unweighted graphs |
| gptkbp:category |
gptkb:search_engine
graph |
| gptkbp:complexity |
O(V+E)
|
| gptkbp:firstDescribed |
gptkb:C._Y._Lee
1961 |
| gptkbp:fullName |
gptkb:Breadth-First_Search
|
| https://www.w3.org/2000/01/rdf-schema#label |
BFS
|
| gptkbp:input |
gptkb:tree
graph |
| gptkbp:isDeterministic |
true
|
| gptkbp:numberOfIssues |
true
|
| gptkbp:optimizedFor |
true
|
| gptkbp:output |
list of nodes in traversal order
|
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:supportsAlgorithm |
gptkb:Dijkstra's_algorithm
DFS |
| gptkbp:usedFor |
graph traversal
shortest path finding |
| gptkbp:usesDataStructure |
queue
|
| gptkbp:bfsParent |
gptkb:Belfast_International_Airport
|
| gptkbp:bfsLayer |
5
|