Most priority queue implementations

• Can implement all these operations in O(log n) time for sets of size n.

• => Running time of Dijkstra’s algorithm:

• insertions:

• deleteMins:

• lookups:

• modifying Dist values:

Previous slide

Next slide

Back to first slide

View graphic version