Skip to main content
. 2017 Oct 25;698:67–78. doi: 10.1016/j.tcs.2017.06.016

Fig. 1.

Fig. 1

An eight-node Wheeler graph. Node 1 has in-degree 0; edges labeled a enters in nodes 2, 3, 4; edges labeled b in nodes 5, 6; edges labeled c in nodes 7, 8.