Question

Depth-first Search vs Breadth-first Search

Please explain the difference!

Answer 1

DFS BFS BFS stands for "Breadth First Search". DFS stands for "Depth First Search It starts traversal from the root node and then It starts the traversal from the root node and the searching is performed in level by leve the then the searching is done from the root manner itself as far as possible. It is done with the help of Queue (Implementing FIFO) It is don't with the help of Stack (Implementing LIFO) BFS algorithm works in a single stage. The DFS algorithm works in two stages vertices which are displayed are removed(i) The vertices which are visited are pushed from the Queue and at once they will be displayed. onto the stack (ii) When there is no vertex to visit further those will be BFS is slower than DFS DFS is faster than BFS When comparing to DFS it rcquircs moroc mcmor It requires less mcmory Applications Applications Finding shortest path Used in cycle detection e Singlc sourcc and all pairs shortcst In testing conncctivity paths Finding a path between V and Win In spanning tree lt is uscd to find thc shortest distanco between the starting and the remaining nodes in the graph. It is used in gencral graph to perform. The idea of DFS to make the path as long as possible and the perform backtracking to add branches Example Example A, B, C, D, E, F A, B, D, CE, F