In MATLAB, there is no built-in data structure for a queue, but it can easily be implemented using MATLAB's basic data structures such as vectors or linked lists.
Here is an implementation of a queue using a simple vector and the built-in end keyword to add an element to the end of the queue, element is added at the end of the vector and dequeue operation can be performed using the pop() method.
main.m191 chars11 lines
Alternatively, you can implement a queue using a linked list data structure which can be more efficient for large queues. In a linked list, you can use the end or tail pointer to add elements at the end of the queue, and a head pointer to remove elements from the front of the queue.
gistlibby LogSnag