Ichthyostega
a780d696e5
It seams indicated to verify the generated connectivity and the hash calculation and recalculation explicitly at least for one example topology; choosing a topology comprised of several sub-graphs, to also verify the propagation of seed values to further start-nodes. In order to avoid addressing nodes directly by index number, those sub-graphs can be processed by ''grouping of nodes''; all parts are congruent because topology is determined by the node hashes and thus a regular pattern can be exploited. To allow for easy processing of groups, I have developed a simplistic grouping device within the IterExplorer framework. |
||
|---|---|---|
| .. | ||
| gear | ||
| mem | ||
| DIR_INFO | ||