Use this if you are using igraph from R
De Bruijn graphs are labeled graphs representing the overlap of strings.
make_de_bruijn_graph(m, n) de_bruijn_graph(...)
Integer scalar, the size of the alphabet. See details below.
Integer scalar, the length of the labels. See details below.
A de Bruijn graph represents relationships between strings. An alphabet of
m letters are used and strings of length
n are considered. A
vertex corresponds to every possible string and there is a directed edge
v to vertex
w if the string of
v can be
transformed into the string of
w by removing its first letter and
appending a letter to it.
Please note that the graph will have
m to the power
and even more edges, so probably you don't want to supply too big numbers
De Bruijn graphs have some interesting properties, please see another source, eg. Wikipedia for details.
A graph object.
Gabor Csardi <email@example.com>
# de Bruijn graphs can be created recursively by line graphs as well g <- make_de_bruijn_graph(2,1) make_de_bruijn_graph(2,2) make_line_graph(g)