The graph traveling: the traditional way is addition and multiplication of the address number; the new way is the switch shifting on the array. 

A program is segments of collection or class graph traveling until blank or separator.

One way is to dynamically connect the results of each traveling by their association behaviour definitions to wait for value input to start the computation to output and then the connection perhaps be modified or released after each computation, but this way will consume so many dynamic allocated buses and switches for netlist.

The other way is to directly replace the series of traveling results by their synonym definitions as computation.