Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:search_engine
|
| gptkbp:advantage |
finds shortest path in unweighted graphs
repeats states multiple times uses less memory than BFS |
| gptkbp:category |
uninformed search
|
| gptkbp:combines |
gptkb:breadth-first_search
depth-first search |
| gptkbp:complexity |
O(b^d)
|
| gptkbp:firstDescribed |
gptkb:Richard_E._Korf
1985 |
| gptkbp:fullName |
gptkb:Iterative_Deepening_Depth-First_Search
|
| https://www.w3.org/2000/01/rdf-schema#label |
IDDFS
|
| gptkbp:parameter |
depth limit
|
| gptkbp:spaceComplexity |
O(d)
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
graph traversal |
| gptkbp:bfsParent |
gptkb:Iterative_Deepening_Depth-First_Search
|
| gptkbp:bfsLayer |
8
|