| Tag PreorderEmptyEdges Preorder depth-first search in a suffix tree with leaves for every suffix. PreorderEmptyEdges Remarks When given as a second parameter in goNext the Suffix Tree is traversed in a preorder fashion (visit the node before its children). Empty edges are traversed also, i.e. for every suffix there is a leaf node representing it. See Also PostorderEmptyEdges, Preorder SeqAn - Sequence Analysis Library - www.seqan.de