priority queue

2 articles · All tags

• Heaps and Priority Queues: How a Binary Heap Works
  A binary heap stores a priority queue in an array, keeping the smallest item at the top, so each insert and each removal takes logarithmic time, or O(log n).
• Dijkstra's Shortest Path Algorithm
  A greedy graph algorithm that finds the shortest paths from a single source vertex to all others in graphs with non-negative edge weights.