De Bruijn graph
= De Bruijn graph
{c}
For an alphabet of size $q$, the order-$n$ directed <graph> has words of length $n-1$ as <vertices> and words of length $n$ as <edges>. An <edge> goes from its prefix of length $n-1$ to its suffix of that length. An <Eulerian cycle> therefore lists every length-$n$ word once as a cyclic window, producing a <De Bruijn sequence>.