Dear friend thanks for the reply,I have already figured out that
Ok. Thanks for the help :)
Just have a look at my question when u will learn graph. It's interesting in itself as in many places you will happen to see different implementation of priority queue resulting in different running time:)
what is the time and space complexity of Dijkstra's algorithm? In the wikipedia article it's given that if the priority queue is implemented as a binary heap,then time complexity is bounded by O( (E+V) log(V)). This makes sense,but also somewhere I have seen it's given O ( Elog(V)). I'm wondering which is more precise. I suspect the former one is more precise. What do u say guys?? Any answer will be appreciated.