Description

A bfirst_cursor implements the breadth-first traversal on acyclic deterministic automata. It is an iterator on a sequence of transitions ordered according to the breadth-first traversal algorithm. The method next_transition allows to increment the cursor, making it point to the next transition in the sequence. This methods returns true if the transition reached has been enqueued and false otherwise (dequeue).
The bfirst_cursor is used in the same way as the iterators on sequence to define ranges for algorithms.