Data engineering and BI courses are free!
graph.kautz(m,n)n+1 above an alphabet with m+1 letters, with
the restriction that every two consecutive letters in the string
must be different. There is a directed edge from a vertex v to
another vertex w if it is possible to transform the string of
v into the string of w by removing the first letter and
appending a letter to it.
Kautz graphs have some interesting properties, see eg. Wikipedia
for details.graph.de.bruijn, line.graphline.graph(graph.kautz(2,1))
graph.kautz(2,2)Run the code above in your browser using DataLab