Question

which of the following about breadth first search and depth first search are correct?
​

Answer 1

BFS(Breadth First Search) uses Queue data structure for finding the shortest path. DFS(Depth First Search) uses Stack data structure. 3. BFS can be used to find single source shortest path in an unweighted graph, because in BFS, we reach a vertex with minimum number of edges from a source vertex.

Answer 2

The correct answer is explained below:

Explanation:

• BFS stands for Breadth First Search.
• It utilizes Queue data structure for finding the shortest path.
• DFS stands for Depth First Search.
• It utilizes Stack data structure to compute single source shortest path in an unweighted graph.
• It is because of BFS, we reach a vertex with minimum number of edges from a source vertex.