bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Change circuit -> path

This commit is contained in:
Antti H S Laaksonen 2017-04-19 21:16:50 +03:00
parent ee7ede62d5
commit 9ca906ee77
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter19.tex
View File

@ -546,7 +546,7 @@ combinations of three bits:
000, 001, 010, 011, 100, 101, 110 and 111.
It turns out that each De Bruijn sequence
corresponds to an Eulerian circuit in a graph.
corresponds to an Eulerian path in a graph.
The idea is to construct the graph so that
each node contains a combination of $n-1$ characters
and each edge adds one character to the string.