📌Hello friends! In this post I am going to explain about Depth First Search (DFS).What is the algorithm/ How we trace algorithm by the help of example.
Depth First Search is a Graph Traversal Methods.It is a technique used to search a vertex in a graph. It is also used to decide the order of vertices to be visited in the search process.
DFS traversal of a graph produce spanning tree as final result is a graph without loops.We use stack data structure with maximum size of total number of vertices in the graph to implement DFS traversal of a graph.
