The Goal of Dijkstra's Algorithm Is

Multiple Choice

The goal of Dijkstra's Algorithm is:

A) To find all possible paths between an origin and another node in a network
B) To find the shortest path between three or more stops by rearranging the travel order between the stops
C) To find the overall shortest path between all stops on a network
D) To find the shortest path between an origin and all other nodes in a network