computer-scienceangular-roadmapbackend-roadmapblockchain-roadmapdba-roadmapdeveloper-roadmapdevops-roadmapfrontend-roadmapgo-roadmaphactoberfestjava-roadmapjavascript-roadmapnodejs-roadmappython-roadmapqa-roadmapreact-roadmaproadmapstudy-planvue-roadmapweb3-roadmap
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
7 lines
346 B
7 lines
346 B
# 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)
|
|
|