For Dijkstra’s shortest path algorithm:
a. Give the Big-O time for Dijkstra’s shortest path algorithmand explain your answer.
b. Does the answer to (a) depend on whether we use an adjacencymatrix or list? Explain your answer.
Expert Answer
An answer will be send to you shortly. . . . .