User:Yayimhere/Graphbased

the program is a string of any number of characters, its length being a multiple of three, and the first input is of even length. there is also a secondary input which isnt used in the first part of execution, which is also of even length. this part of it defines a graph where, for every triplet in the program xyz and pair ax:

a
 \
  x-y
  |
  z

other than just defining it like this, every instance of a specific symbol in the graph are merged to a single node. Note that every character has an implicit number, defined as the minimum index that character appears in either the program or input. then it creates a string, in which for every pair of characters ab, it replaces it with bai... where i is the smallest numbered thing connected to either a, or connected to something b is connected to. then this new generated string is used as the program string, the original input is used as the secondary input, and the first input is replaced with the program appended to itself.