hello everyone,
I think that that the worst case time complexity of the dijkstra's algorithm is O(Elog(V)) and for the situation when a complete graph is considered, this will change to O(V^2(log(V))).
..( i am following the heap , extract min, and decrease key implementation from the CLRS)
But then in one of the solutions I found it was given O(E +V(logV)), which for the complete graph changed to O(n^2 + V(logV)).
Please let me know if my reasoning is wrong.
