Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix. What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?
How to solve this kinds of problems ? Changing DS used in one algorithm . Do I need to study the entire algorithm ?