Description

A dfirst_cursor implements the depth-first traversal on acyclic deterministic automata. It is in some sense an iterator on a sequence of transitions ordered according to the depth-first traversal algorithm. The method forward 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 pushed onto the stack (forward move) and false otherwise (pop and backward move).
The dfirst_cursor is fundamental because it is used much in the same way as the iterators on sequence to define ranges for algorithms.