---
title: "Discussion on \"Depth First Search (DFS)\" | Hashnode"
description: "Discussion on \"Depth First Search (DFS)\". In a Nutshell\n\nTypically used on graphs or trees represented as adjacency lists or hash maps.\n\nExplores a tree/graph data structure as deep as possible before backtracking.\n\nUseful when you want to check if a path exists, not necessarily the shortest..."
url: "https://hashnode.com/posts/depth-first-search-dfs/6854e2d97b7d574480c4b144"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Depth First Search (DFS)](https://learncodedaily.hashnode.dev/depth-first-search-dfs?utm_source=hashnode&utm_medium=feed)

In a Nutshell Typically used on graphs or trees represented as adjacency lists or hash maps. Explores a tree/graph data structure as deep as possible before backtracking. Useful when you want to check if a path exists, not necessarily the shortest...

Jun 20, 2025 · 4 min read · learncodedaily.hashnode.dev  
Updated Jun 24, 2025  
Read the article

-   [#depth-first-search](https://hashnode.com/tag/depth-first-search)
-   [#leetcode](https://hashnode.com/tag/leetcode)

## Written by

[Michael Peattie](https://hashnode.com/@physics2comp)

@physics2comp

  
[View profile](https://hashnode.com/@physics2comp)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.