A queue implementation that dequeues elements in a random order.

Inherits From: QueueBase

See tf.queue.QueueBase for a description of the methods on this class.

capacity An integer. The upper bound on the number of elements that may be stored in this queue.
min_after_dequeue An integer (described above).
dtypes A list of DType objects. The length of dtypes must equal the number of tensors in each queue element.
shapes <