How can I optimize a priority queue in Python?

How can I optimize a priority queue in Python?

You can optimize a priority queue in Python by using the heapq module, which provides an efficient implementation.

What are the advantages of using heapq over a regular list?

Using heapq allows for O(log n) time complexity for insertions and deletions, compared to O(n) for lists.

Can you show me a simple example of using heapq?

Sure! Here's a basic example:

import heapq

pq = []
heapq.heappush(pq, (1, 'task1'))
heapq.heappush(pq, (3, 'task3'))
heapq.heappush(pq, (2, 'task2'))

while pq:
    priority, task = heapq.heappop(pq)
    print(f'Processing {task} with priority {priority}')

Are there any other libraries for priority queues in Python?

Yes, you can also use libraries like queue.PriorityQueue or third-party libraries like sortedcontainers for more features.