Assertion: single queue | /r/CapableOf | use a queue data structure
Facets:
Source sentences:
text: Equivalently, from a queue layout, one could process the edges in a single queue using a queue data structure, by considering the vertices in their given ordering, and when reaching a vertex, dequeueing all edges for which it is the second endpoint followed by enqueueing all edges for which it is the first endpoint.