Try this exercise. Click the correct answer from the options.
If we want to find the shortest path between any two nodes in an unweighted graph, which search should we use?
Click the option that best answers the question.
- BFS
- DFS
Back to course sections
Mark As Completed Discussion