What do you understand about the DFS (Depth First Search) algorithm.

1.	What do you understand about the DFS (Depth First Search) algorithm.
Answer» Depth First Search or DFS is a technique for traversing or exploring DATA structures such as trees and graphs. The algorithm starts at the root node (in the case of a graph, any random node can be USED as the root node) and EXAMINES each branch as far as feasible before retracing. So the basic idea is to start at the root or any arbitrary node and mark it, then advance to the next unmarked node and repeat until there are no more unmarked nodes. After that, go back and check for any more unmarked nodes to cross. Finally, print the path's nodes. The DFS algorithm is given below: Step1: Create a recursive FUNCTION that takes the node's index and a visited ARRAY as input. Step 2: Make the current node a visited node and print it. Step 3: Call the recursive function with the index of the adjacent node after traversing all nearby and unmarked nodes.

Answer»

Depth First Search or DFS is a technique for traversing or exploring DATA structures such as trees and graphs. The algorithm starts at the root node (in the case of a graph, any random node can be USED as the root node) and EXAMINES each branch as far as feasible before retracing. So the basic idea is to start at the root or any arbitrary node and mark it, then advance to the next unmarked node and repeat until there are no more unmarked nodes. After that, go back and check for any more unmarked nodes to cross. Finally, print the path's nodes. The DFS algorithm is given below:

Step1: Create a recursive FUNCTION that takes the node's index and a visited ARRAY as input.
Step 2: Make the current node a visited node and print it.
Step 3: Call the recursive function with the index of the adjacent node after traversing all nearby and unmarked nodes.

Discussion

No Comment Found

Related InterviewSolutions

What do you understand about the DFS (Depth First Search) algorithm.
What do you understand about the BFS (Breadth First Search) algorithm.
Write down a string reversal algorithm. If the given string is "kitiR," for example, the output should be "Ritik".
What do you understand about the Dynamic Programming (DP) Algorithmic Paradigm? List a few problems which can be solved using the same.
Write an algorithm for counting the number of leaf nodes in a binary tree.
Write down an algorithm for adding a node to a linked list sorted in ascending order(maintaining the sorting property).
Describe the Binary Search Algorithm.
Describe the Linear Search Algorithm.
What do you understand by a searching algorithm? List a few types of searching algorithms.
What do you understand about greedy algorithms? List a few examples of greedy algorithms.