Dear friend thanks for the reply,I have already figured out that

Active In

Competitive Programming

CP noobs

Algorithms and Data Structures

Commonlounge Meta

Competitive Programmer's Handbook

Artificial Intelligence

U.S. College Admissions for International Students

Featured Contributions

reply in this discussion

Dear friend thanks for the reply,I have already figured out that

Read more… (11 words)

reply in this discussion

reply in this discussion

reply in this discussion

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:)

Read more… (41 words)

reply in this discussion

I would tell you to read specifically about the time complexity of the algorithm. Click on the highlighted text below. May be somewhere I'm getting it wrong. Be it anything,I would be thankful if we can discuss it

Read more… (40 words)

reply in this discussion

For unweighted graph,we don't need Dijkstra at all, BFS is the soultion.

Read more… (12 words)

reply in this discussion

reply in this discussion

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.

Read more… (72 words)