ConceptAI & ML
Depth-first search (DFS) completeness
DFS is complete if the tree is not infinite and finiteness assumptions hold.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.