Register
The complexity of bfs and dfs
2.9k views
2 votes
The complexity of bfs and dfs

User Ron Thompson
by
4.6k points

1 Answer

2 votes

Answer:

BFS uses Queue to find the shortest path. DFS uses Stack to find the shortest path. ... Time Complexity of BFS = O(V+E) where V is vertices and E is edges. Time Complexity of DFS is also O(V+E) where V is vertices and E is edges.

Step-by-step explanation:

User Muradm
by
4.1k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

4.5m questions

5.9m answers

Other Questions

Evan is building a toy rocket. He wants to fill the rocket with high-pressure water in order to launch it into the air. Which of the following materials would be the best choice for constructing the outside
Which of the following questions would an immunologist be most interested in? How does lung cancer spread to other organs? How long does it take for bones to repair themselves after breaks? What is the
Implement this C program by defining a structure for each payment. The structure should have at least three members for the interest, principle and balance separately. And store all the payments in a structure
Only an outer panel is being replaced. Technician A says that removing the spot welds by drilling through both panels allows the plug welds to be made through the replacement outer panel. Technician B
What are the main causes of injuries when using forklifts?
Link Copied!