In this paper, we provide a novel enumeration algorithm for the set of all walks of a given length within a directed graph. Our algorithm has worst-case constant delay between outputting succinct representations of such walks, after a preprocessing step requiring linear time relative to the size of the graph. We apply these results to the problem of enumerating succinct representations of the strings of a given length from a prefix-closed regular language (languages accepted by a finite automaton which has final states only).

翻译：本文提出一种用于枚举有向图中所有给定长度路径的新型枚举算法。该算法在预处理阶段（所需时间与图规模呈线性关系）后，能够在输出此类路径的紧凑表示时保持最坏情况下的常数延迟。我们将这些结果应用于枚举给定长度的字符串的紧凑表示问题，这些字符串来自一个前缀封闭的正则语言（即仅由有限自动机接受且仅含终态的语言）。