How do I use the heapq module in Python for priority queues?

How do I use the heapq module in Python for priority queues?

You can use the heapq module to implement a priority queue in Python. It provides an efficient way to maintain a sorted order.

Can you show me a simple example of how to implement it?

Sure! Here's a basic example:

import heapq

# Create an empty priority queue
priority_queue = []

# Add items with their priority
heapq.heappush(priority_queue, (2, 'task 2'))
heapq.heappush(priority_queue, (1, 'task 1'))
heapq.heappush(priority_queue, (3, 'task 3'))

# Pop items in order of priority
while priority_queue:
    print(heapq.heappop(priority_queue))

What happens if I add items with the same priority?

If you add items with the same priority, they will be returned in the order they were added, as heapq maintains a stable sort.