Great memory interface

Short and minal, but is still a graph. On output, itm hs branch and descend, the equivalent dot and comma separation. There is no insert, at the moment, and anhy insert will cause a bubble move of gthe base. It is optimized for read, instant stepping and jumping. The key idea is to treat everything as an array of ints and the compiler will do arithmetic on the integer indices without complaining. With the join machine you have maybe for calls between on graph attachment and another. That is very short for entirely independent applications who only agree on what is a graph and match.