---
title: "Discussion on \"13.Depth-First Search (DFS)\" | Hashnode"
description: "Discussion on \"13.Depth-First Search (DFS)\". Definition\nDFS explores as far down a branch as possible before backtracking.It follows one path deeply until it can’t go further, then goes back and explores other paths.\nAlgorithm (Simple Steps)\n\nPu"
url: "https://hashnode.com/posts/13-depth-first-search-dfs/699b28ebe25d1517a5016763"
---

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

Discussion

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

Definition DFS explores as far down a branch as possible before backtracking.It follows one path deeply until it can’t go further, then goes back and explores other paths. Algorithm (Simple Steps) Pu

Feb 22 · 3 min read · ai-for-multidisciplinary-application.hashnode.dev  
Read the article

-   [#ai](https://hashnode.com/tag/ai)
-   [#artificial-intelligence](https://hashnode.com/tag/artificial-intelligence)
-   [#data-science](https://hashnode.com/tag/data-science)
-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#ml](https://hashnode.com/tag/ml)
-   [#machine-learning](https://hashnode.com/tag/machine-learning)
-   [#deep-learning](https://hashnode.com/tag/deep-learning)
-   [#dfs](https://hashnode.com/tag/dfs)
-   [#search](https://hashnode.com/tag/search)
-   [#searching-algorithms](https://hashnode.com/tag/searching-algorithms)

## Written by

[Pranoti Patil](https://hashnode.com/@vibesAI)

@vibesAI

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

Simple notes for computer science students

## Responses

Markdown supported · ⌘↵ to post

No responses yet.