Depth first search is one of the popular graph traversal algorithms that work well for certain purposes.As you can infer from the name DFS is quite different from BFS – breadth first search.Therefore the applications of DFS are different from BFS.In this post, I am going to discuss how DFS works with examples.Please refer to my other post of BFS if you are interested in. How does DFS work? I am going to start by explaining DFS by comparing it with BFS.Please note that BFS searches all the neighbors at the same level or degree before you move to the READ MORE