Depth First Search || Graph Traversal || Data Structures

This video covers DFS algorithm for traversing nodes in a graph. It uses a concept of backtracking. For implementation, we use stack in this algorithm. In this video, the concept of DFS has been discussed along with its psuedo code and an example. Happy Learning!!