Once a tree gains paths from lower nodes to upper nodes, as in a tree with loopbacks, it becomes a directed graph (Crawford 2005). Meadows (2003) refers to such structures as "open", but it can also be seen as a network or hypertext structure.
In a true Open structure, any path through any of the nodes will result in a story. Or else attempts at a well-formed story have been abandoned.
Argax Project : Dissertation :
A Rough Draft Node http://www2.hawaii.edu/~ztomasze/argax |
Last Edited: 13 Dec 2006 ©2006 by Z. Tomaszewski. |