Graph Traversal : DFS( Depth First Traversal)

CSE { computer science & engineering } Video Lectures. In this Lecture you will be learning about the DFS (Depth First Traversal). Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. For more info / doubt write us at our mail or comment below. PLEASE LIKE , SHARE & SUBSCRIBE