Statements (33)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
graph traversal algorithm |
| gptkbp:category |
gptkb:artificial_intelligence
computer science discrete mathematics |
| gptkbp:complexity |
O(V+E)
|
| gptkbp:firstDescribed |
gptkb:Robert_Tarjan
gptkb:Pierre_Rosenstiehl 1970s |
| gptkbp:hasVariant |
depth-limited search
iterative deepening depth-first search randomized depth-first search |
| gptkbp:heldBy |
systematic search method
uninformed search algorithm |
| https://www.w3.org/2000/01/rdf-schema#label |
Depth-first search
|
| gptkbp:implementedIn |
recursion
stack |
| gptkbp:input |
gptkb:tree
graph |
| gptkbp:output |
traversal order
visited nodes |
| gptkbp:relatedTo |
gptkb:breadth-first_search
|
| gptkbp:spaceComplexity |
O(V)
|
| gptkbp:usedFor |
solving puzzles
topological sorting finding connected components cycle detection path finding searching data structures traversing graphs traversing trees |
| gptkbp:bfsParent |
gptkb:Graph_theory
|
| gptkbp:bfsLayer |
5
|