The question is connected to this answer here: Dijkstra looped tree. He states that time complexity is O(V Log V), but shouldn't it be O(N ^ 2), since if there is a very heavy edge the algorithm will have to check each vertices. Can someone give an example stating otherwise.
Asked
Active
Viewed 24 times
