How can I implement advanced queue structures in Python?

How can I implement advanced queue structures in Python?

You can implement advanced queue structures like priority queues and circular queues using Python's built-in libraries or custom classes.

Can you show me an example of a priority queue implementation?

Sure! You can use the heapq module to create a priority queue. Here's a simple example:

import heapq

class PriorityQueue:
    def __init__(self):
        self.elements = []

    def is_empty(self):
        return not self.elements

    def put(self, item, priority):
        heapq.heappush(self.elements, (priority, item))

    def get(self):
        return heapq.heappop(self.elements)[1]

What about a circular queue? How would that work?

A circular queue can be implemented using a list and two pointers to track the front and rear. Here's a basic example:

class CircularQueue:
    def __init__(self, size):
        self.size = size
        self.queue = [None] * size
        self.front = self.rear = -1

    def enqueue(self, item):
        if (self.rear + 1) % self.size == self.front:
            raise Exception('Queue is full')
        elif self.front == -1:
            self.front = self.rear = 0
        else:
            self.rear = (self.rear + 1) % self.size
        self.queue[self.rear] = item

    def dequeue(self):
        if self.front == -1:
            raise Exception('Queue is empty')
        item = self.queue[self.front]
        if self.front == self.rear:
            self.front = self.rear = -1
        else:
            self.front = (self.front + 1) % self.size
        return item