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)?
Time complexity : O ((| E | + | V |) log | V |)
Say we only know the worst case and best case complexity of an algo (Algo is not known). Is it possible to get the average case complexity?
using adjacency matrix representation of graph?
