Through introduction of a ''pruning rule'', it is possible to create exit nodes in the middle of the graph. With increased intensity of pruning, it is possible to ''choke off'' the generation and terminate the graph; in such a case a new seed node is injected automatically. By combination with seed rules, an equilibrium of graph start and graph termination can be achieved. Following this path, it should be possible to produce a pattern, which is random but overall stable and well suited to simulate a realistic processing load. However, finding proper parameters turns out quite hard in practice, since the behaviour is essentially contingent and most combinations either lead to uninteresting trivial small graph chunks, or to large, interconnected and exponentially expanding networks |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||