# Depth First Search

Depth first search is a graph traversal algorithm that starts at a root node and explores as far as possible along each branch before backtracking.

Visit the following resources to learn more:

- [@article@Depth First Search or DFS for a Graph](https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/?ref=lbp)