Genetic Algorithms and Neural Networks: The Building Blocks of Artificial Life

ly, a queue is a list to which elements are added at one end and removed at the other. Such a queue is represented below by two lists: one named queueFront, which contains the elements near the front of the queue, and queueRear, which contains the elements near the rear of the queue stored in reverse order. If queueFront was concatenated to the reverse of queueRear, then the result would be the abstract queue mentioned above. The queue’s size is also stored for the sake of convenience (the value of queueSize could easily be calculated at any time by adding the lengths of the two lists).