Use Dijkstra's algorithm to find the shortest distances and corresponding routes from A to each of the other vertices in the given network.
\includegraphics[max width=\textwidth, alt={}, center]{839adc96-1bea-44ef-917e-f03e396a3061-2_588_792_632_632}
If the shortest distances and routes between every pair of vertices are required how many applications of Dijkstra will be needed?