🚀 go-pugleaf

Of course, any cyclic structure can be "broken up" into an acyclic
structure by naming its nodes (say, with numbers) and storing their 
values in some sort of array.  For some applications the packages
in the standard libraries that run in n lg n time are satisfactory,
but for, say, dealing with larger FSAs the non-constant access
time is too great a price to pay.  (Asserting the relevant facts
into the database can give almost constant time access, but at
the high cost of assertion, not to mention the abandonment of
the simple logical semantics).

Cyclic structures allow DFSAs to be implemented so that following
an arc can be performed in constant time. 

Mark