DFS tana binciken jadawali ta hanyar tafiya sosai kai da kai tare da kowane reshe kafin jiya. Tana amfani da stack (sau da yawa call stack ta hanyar recursion) da kuma hutu da cikakken hanya kafin bada zaure.
Tunanin
Daga nodda, sake zirge zuwa abokin gida da ba a gana ba, kuma koma jiya; idan an kulle, koma jiya kuma gwada wani reshe.
Misali
python
():
visited :
visited = ()
visited.add(node)
order = [node]
nbr graph[node]:
nbr visited:
order += dfs(graph, nbr, visited)
order
graph = {: [, ], : [], : [], : []}
dfs(graph, )
