Ichthyostega
a983a506b0
Initially the model was that of a single graph starting with one seed node and joining all chains into a single exit node. This however is not well suited to simulate realistic calculations, and thus the ability for injecting additional seeds and to randomly sever some chains was added -- which overthrows the assumption of a single exit node at the end, where the final hash can be retrieved. The topology generation used to pick up all open ends, in order to join them explicitly into a reserved last node; in the light of the above changes, this seems like an superfluous complexity, and adds a lot of redundant checks to the code, since the main body of the algorithm, in its current form, already does all the necessary bound checks. It suffices thus to just terminate the processing when the complete node space is visited and wired. Unfortunately this requires to fix basically all node hashes and a lot of the statistics values of the test; yet overall the generated graphs are much more logical; so this change is deemed worth the effort. |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||