Question: Which of the following scenarios is Dijkstra\'s algorithm best suited for?

Options:

1. Finding the shortest path in a road network
2. Sorting a list of numbers
3. Searching for an element in a binary search tree
4. Finding the maximum flow in a network

Correct Answer: Finding the shortest path in a road network

Solution:

Dijkstra\'s algorithm is particularly effective for finding the shortest path in road networks where edges have non-negative weights.