Limited access

Upgrade to access all content for this subject

You are given a map with cities and roads connecting the cities. You are tasked with finding the shortest path from your starting city to all of the other cities on​ the map.

Which of the following answers will solve this problem most efficiently?

A

Prim's Algorithm.

B

Kruskal's Algorithm.

C

Bellman-Ford Algorithm.

D

Dijkstra's Algorithm.

Select an assignment template