Print("No element in the circular queue")įor i in range(self.head, self.tail + 1): # Delete an element from the circular queue If ((self.tail + 1) % self.k = self.head): # Insert an element into the circular queue # Circular Queue implementation in Python for the last element, reset the values of FRONT and REAR to -1.circularly increase the FRONT index by 1.add the new element in the position pointed to by REAR.if the rear reaches the end, next it would be at the start of the queue) circularly increase the REAR index by 1 (i.e.
for the first element, set value of FRONT to 0.initially, set value of FRONT and REAR to -1.
Here, the circular increment is performed by modulo division with the queue size. when we try to increment the pointer and we reach the end of the queue, we start from the beginning of the queue. This reduces the actual size of the queue.Ĭircular Queue works by the process of circular increment i.e. Here, indexes 0 and 1 can only be used after resetting the queue (deletion of all elements). In a normal queue, after a bit of insertion and deletion, there will be non-usable empty space. The circular queue solves the major limitation of the normal queue. Decrease Key and Delete Node Operations on a Fibonacci HeapĪ circular queue is the extended version of a regular queue where the last element is connected to the first element.
0 kommentar(er)
