Answer:
A. from one specified vertex to all the other vertices
Explanation:
Dijkstra's algorithm allows us to find the all the vertices from a chosen vertex. It is used to calculate the shortest path between points. Network routing protocols is a good example of this. While you are surfing on the internet, the content that will be shown to you comes from a server. The logic behind that follows this algorithm. Depending on your location, the content is provided to you from the closest server. To do that, all the servers that are close to you are considered and the one that has the shortest distance is selected.
