Login and Register ×
Check your Email for the OTP
Data Structure Searching Algorithms
⚠ Report ✓ Question Verified Copy Link
Explanation:
Answer: Breadth-first search
Explanation: Breadth-first search can be used for finding the shortest path between two nodes in a graph because it visits all the nodes at a given level before moving on to the next level.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Searching Algorithms