| Tag PreorderEmptyEdges Preorder depth-first search in a suffix tree with leaves for every suffix. PreorderEmptyEdges Include Headers seqan/index.h 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 Preorder, PostorderEmptyEdges SeqAn - Sequence Analysis Library - www.seqan.de

Page built @2012/03/14 16:34:52