This snippet defines a function walk() which generically performs a depth-first traversal of a tree, using preorder, inorder or postorder rules. Here, genericity means here that there are no hypotheses on what the tree nodes are or the implementation of the tree. Walk() only needs an arbitrary object used as a root node and a function generating children 'nodes' for a given 'node'. At any moment during the walk, it exposes the path from the root node to the visited node. Finally, the implementation is fully non recursive, allowing very deep trees to be traversed.

IMPORTANT: this snippet needs class ConstSequence from the snippet
http://www.daniweb.com/software-development/python/code/395101

Edited 5 Years Ago by Gribouillis: n/a

Comments
Neat
#!/usr/bin/env python
# -*-coding: utf8-*-
# Title: walktree.py
# Author: Gribouillis for the python forum at www.daniweb.com
# Created: 2011-11-18 23:28:39.608291 (isoformat date)
# License: Public Domain
# Use this code freely.

"""This module implements a generic depth first tree traversal.
"""

from __future__ import print_function
from collections import deque
# IMPORTANT NOTE: this module needs the class ConstSequence
# from http://www.daniweb.com/software-development/python/code/395101
from constsequence import ConstSequence

version_info = (1, 0)
version = ".".join(map(str, version_info))
PREORDER, INORDER, POSTORDER = tuple(range(3))
_innernode = object()

def walk(node, gen_subnodes, order=PREORDER, reverse_path = False):
    """Traverse a tree based at 'node' and generate a sequence of paths
    in the tree from the root node to the visited node.
    
    Typical use:
        
        for path in walk(node, func):
            visited = path[-1]
            if path.is_leaf:
                print(visited, "is a leaf node!")
                
    The generated 'path' is a read-only sequence with path[0] being
    the base node of the walk and path[-1] being the visited node. If
    reverse_path is set to True, the path will appear from right to left,
    with the visited node in position 0. During the whole walk, the function
    generates the same path object, but in a different state. At any step,
    path.is_leaf is a boolean indicating that the visited node is a leaf
    in the tree.
    
    The arguments are
        @ node : an arbitrary python object
        @ gen_subnodes : a function defining the tree structure. It must have
            the interface gen_subnodes(node) --> iterable containing other nodes.
            this function will be called with the initial node and the descendent
            nodes that it generates through this function.
        @ order: an integer with possible values PREORDER, INORDER, POSTORDER which
            are defined in this module.
        @ reverse_path: a boolean indicating that the path should be read
            from right to left.
    """
    indexes = ((2, 0, 1), (2, 1, 0), (1, 2, 0))[order]
    todo = deque((iter((node,)),))
    path = deque()
    const_path = ConstSequence(path)
    if reverse_path:
        ppush, ppop = path.appendleft, path.popleft
    else:
        ppush, ppop = path.append, path.pop
    while todo:
        sequence = todo.pop()
        if sequence is None:
            ppop()
        elif sequence is _innernode:
            const_path.is_leaf = False
            yield const_path
        else:
            try:
                node = next(sequence)
            except StopIteration:
                pass
            else:
                todo.append(sequence)
                ppush(node)
                todo.append(None)
                sub = iter(gen_subnodes(node))
                try:
                    left = next(sub)
                except StopIteration:
                    const_path.is_leaf = True
                    yield const_path
                else:
                    t = (iter((left,)), _innernode, sub)
                    todo.extend(t[i] for i in indexes)

if __name__ == "__main__":
    # an example tree
    root = (
      ((1,2), (4,5), 6),
      (7, (9)),
    )
    
    # a function to generates subnodes for our tree
    def subn(node):
        if isinstance(node, tuple):
            return node
        else:
            return ()
        
    # using the walk() generator on our tree
    for path in walk(root, subn, POSTORDER):
        print(("leaf " if path.is_leaf else "inner"), list(path))
        
""" example code output --->
leaf  [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2), 1]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2), 2]
inner [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2)]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5), 4]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5), 5]
inner [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5)]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), 6]
inner [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6)]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), (7, 9), 7]
leaf  [(((1, 2), (4, 5), 6), (7, 9)), (7, 9), 9]
inner [(((1, 2), (4, 5), 6), (7, 9)), (7, 9)]
inner [(((1, 2), (4, 5), 6), (7, 9))]
"""

This improved version permits to generate inner nodes more than once (for example once when they are entered and once when they are left). An attribute path.moment describes the current position in the walk. The algorithm was slightly optimized in this version, and the interface also changed (no more 'is_leaf' attribute and the 'moment' argument, see the doctring of walk() for information). Happy tree traversal !

#!/usr/bin/env python
# -*-coding: utf8-*-
# Title: walktree.py
# Author: Gribouillis for the python forum at www.daniweb.com
# Created: 2011-11-18 23:28:39.608291 (isoformat date)
# License: Public Domain
# Use this code freely.

"""This module implements a generic depth first tree traversal.
"""

from __future__ import print_function
from collections import deque, namedtuple

# IMPORTANT NOTE: this module needs the class ConstSequence
# from http://www.daniweb.com/software-development/python/code/395101
from constsequence import ConstSequence

version_info = (1, 2)
version = ".".join(map(str, version_info))

# implementation constants
class _Moment(object):
    __slots__ = ("pos", "name")
    def __init__(self, pos, name):
        self.pos, self.name = pos, name
    def __str__(self):
        return self.name
_popctl = _Moment(None, None)
_pattern = (None, 0, None, 1, None)
enter, within, exit, leaf = _moments = tuple(_Moment(2*i, name)
                for (i, name) in enumerate("enter within exit leaf".split()))

def _selector(moment):
    L = list(_pattern)
    for m in ((moment,) if isinstance(moment, _Moment) else moment):
        if m is leaf:
            continue
        L[m.pos] = m
    return list(reversed(list(x for x in L if x is not None)))

def walk(node, gen_subnodes, moment = enter, reverse_path = False):
    """Traverse a tree based at 'node' and generate a sequence of paths
    in the tree from the root node to the visited node.

    The arguments are
    
        @ node : an arbitrary python object used as root of the tree.
        @ gen_subnodes : a function defining the tree structure. It must have
            the interface gen_subnodes(node) --> iterable containing other nodes.
            this function will be called with the initial node and the descendent
            nodes that it generates through this function.
        @ moment: one of the constants (enter, within, exit) or a (possibly empty)
            sequence of these constants. This argument specifies when the paths
            to inner nodes are generated. If the sequence is empty, only the leaf
            nodes will be generated
        @ reverse_path: a boolean indicating that the path should be read
            from right to left.
    
    Typical use:
        
        for path in walk(node, func, enter):
            # passing enter produces a preorder traversal
            visited = path[-1]
            if path.moment is leaf:
                print(visited, 'is a leaf node!')
                
    The generated 'path' is a read-only sequence with path[0] being
    the base node of the walk and path[-1] being the visited node. If
    reverse_path is set to True, the path will appear from right to left,
    with the visited node in position 0. During the whole walk, the function
    generates the same path object, each time in a different state. Notice
    that this path is implemented using a collections.deque object, which means
    that indexing an element in the middle of the path may require a time
    proportional to its length.
    
    The generated paths have an attribute path.moment which possible value
    is one of the constant objects (enter, within, exit, leaf) with the meanings
    
        enter:  the current visited node is an inner node of the tree
                before this node's subtrees are visited
        within: an inner node after its first subtree has been visited but
                before the other subtrees.
        exit:   an inner node after its subtrees have been visited
        leaf:   a leaf node
    
    Inner nodes are generated depending on the arguments passed in the 'moment'
    slot of the call. Passing moment = () will generate only the leaves. Leaves
    are always generated. To walk only through inner nodes, one can filter the
    walk with
    
        for path in (p for p in walk(node, func, enter) if p.moment is not leaf):
            ...
    
    The constant moments are also attributes of the walk function, namely
    (walk.enter, walk.within, walk.exit, walk.leaf)
    """
    selector = _selector(moment)
    ileft, isub = (selector.index(i) for i in (0, 1))
    todo = deque((iter((node,)),))
    path = deque()
    const_path = ConstSequence(path)
    if reverse_path:
        ppush, ppop = path.appendleft, path.popleft
    else:
        ppush, ppop = path.append, path.pop
    less, more, manymore = todo.pop, todo.append, todo.extend
    try:
        while True:
            sequence = todo[-1]
            if sequence.__class__ is _Moment:
                less()
                if sequence is _popctl:
                    ppop()
                else:
                    const_path.moment = sequence
                    yield const_path
            else:
                try:
                    node = next(sequence)
                except StopIteration:
                    less()
                else:
                    more(_popctl)
                    ppush(node)
                    sub = iter(gen_subnodes(node))
                    try:
                        left = next(sub)
                    except StopIteration:
                        const_path.moment = leaf
                        yield const_path
                    else:
                        selector[ileft] = iter((left,))
                        selector[isub] = sub
                        manymore(selector)
    except IndexError:
        pass

for _m in (enter, within, exit, leaf):
    setattr(walk, _m.name, _m)

if __name__ == "__main__":
    # an example tree
    root = (
      ((1,2), (4,5), 6),
      (7, 9),
    )
    
    # a function to generates subnodes for our tree
    def subn(node):
        if isinstance(node, tuple):
            return node
        else:
            return ()
        
    # using the walk() generator on our tree
    for path in walk(root, subn, (walk.enter, walk.exit)):
        print("{0:<7}".format(path.moment), list(path))
        
""" example code output --->
enter   [(((1, 2), (4, 5), 6), (7, 9))]
enter   [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6)]
enter   [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2)]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2), 1]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2), 2]
exit    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (1, 2)]
enter   [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5)]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5), 4]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5), 5]
exit    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), (4, 5)]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6), 6]
exit    [(((1, 2), (4, 5), 6), (7, 9)), ((1, 2), (4, 5), 6)]
enter   [(((1, 2), (4, 5), 6), (7, 9)), (7, 9)]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), (7, 9), 7]
leaf    [(((1, 2), (4, 5), 6), (7, 9)), (7, 9), 9]
exit    [(((1, 2), (4, 5), 6), (7, 9)), (7, 9)]
exit    [(((1, 2), (4, 5), 6), (7, 9))]
"""

Edited 5 Years Ago by Gribouillis: n/a

This is hopefully the last release of this algorithm. I added support to walk directed graphs generically from a given node. To implement this, I had to rethink the 'moments' system of version 1.2 and change it to an "events" system. The generator now walks through the graph and generate paths which correspond to certain events. For example the event 'enter' means that the walk reached an inner node for the first time and generates this event before the traversal of the subgraph. The event 'cycle' means that the path led to a loop, etc. These events are small integer which can be composed with the bitwise operators |, &, ^, ~ in a coherent way. For example the event 'leaf & ~bounce' means that the path met a leaf of the graph for the first time. The arguments of the call to walk() allow the calling code to select precisely the events that it wants to see. The code also includes a function event_repr() to display walk events in a human-readable way.
Finally, note that this algorithm performs only depth-first walk, and that there are many other ways to walk in a graph...

#!/usr/bin/env python
# -*-coding: utf8-*-
# Title: walktree.py
# Author: Gribouillis for the python forum at www.daniweb.com
# Created: 2011-11-18 23:28:39.608291 (isoformat date)
# License: Public Domain
# Use this code freely.
# IP: http://www.daniweb.com/software-development/python/code/395270

"""This module implements a generic depth first tree and graph traversal.
"""

from __future__ import print_function
from collections import deque, namedtuple
# IMPORTANT NOTE: this module needs the class ConstSequence
# from http://www.daniweb.com/software-development/python/code/395101
from constsequence import ConstSequence
from functools import reduce
import operator
import sys

version_info = (1, 4)
version = ".".join(map(str, version_info))
__all__ = ["walk", "event", "event_repr",
            "enter", "within", "exit", "leaf", "bounce", "cycle"]

class _Int(int):
    pass

_cs = _Int()
for _i, _line in enumerate("""
    lnr: leaf non bounce
    lr: leaf bounce
    irnc: inner bounce non cycle
    ie: inner enter
    iw: inner within
    ix: inner exit
    ic: inner bounce cycle
    """.strip().splitlines()):
    _name = _line.lstrip().split(":")[0]
    setattr(_cs, _name, 1 << _i)

_NamedEvent = namedtuple("_NamedEvent", "name value")
def _event_items():
    yield "leaf", _cs.lnr | _cs.lr
    yield "inner", _cs.irnc | _cs.ie | _cs.iw | _cs.ix | _cs.ic
    yield "enter", _cs.ie
    yield "within", _cs.iw
    yield "exit", _cs.ix
    yield "bounce", _cs.lr | _cs.irnc | _cs.ic
    yield "cycle", _cs.ic
_named_events = tuple(_NamedEvent(*pair) for pair in _event_items())
globals().update(dict(_named_events))    
_event_names = tuple(e.name for e in _named_events)


def _test_events():
    for i, t in enumerate((
        _cs.lnr == (leaf & ~bounce),
        _cs.lr == (leaf & bounce),
        0 == (leaf & inner),
        _cs.irnc == (inner & bounce & ~cycle),
        (_cs.ie == enter) and (_cs.ie == (inner & enter)),
        (_cs.iw == within)  and (within == (inner & within)),
        (_cs.ix == exit) and (exit == (inner & exit)),
        (_cs.ic == cycle) and (cycle == (inner & cycle)),
        (cycle & bounce) == cycle,
        (cycle | bounce) == bounce,
    )):
        assert t, i


_enter, _within, _exit, _cycle, _pop = (
    _Int(enter), _Int(within), _Int(exit), _Int(cycle), _Int(1 << 15))

def parse_event_arg(events):
    if isinstance(events, int):
        events = (events,)
    events = event(reduce(operator.or_, events))
    selector = [_pop, None, '', None, '', None]
    for i, ev in ((1, _exit),(3, _within),(5, _enter)):
        if ev & events:
            selector[i] = ev
    selector = list(item for item in selector if item is not None)
    mask = event(events)
    return mask, selector

def event(n):
    """Keep only the lowest byte of an integer.
    This function is useful because bitwise operations in python
    yield integers out of the range(128), which represents walk events."""
    return n & 127

if sys.version_info < (3,):
    def bytes(x, **args):
        return x
    
def event_repr(_event_names):
    import base64, re, zlib

    s = """eNpVklEOwyAMQ2+D2r8CaX+4CyeJOPtsJ3SbtIYM8jDEXKWOq6wbAd+o5S7rGXXe
    E4PyyzW0cVzeziz1hvmG8vWU1cuyWJ1RGoTmmXQpeBeIiA9gy9UDZAd5qjTRvdhQyyxFRbf
    gA66+SO4/bx7RQtlEI+IL5b6VbSvbV7mrhOKmS2xxk7i2EI/ZGRlmv3fmLUwbBdgF9lc7wc
    zWTiNWUvjBAUBMdpnXnzui/Bk5r/0YnTgwoIRvHCtLWhZpVKzh4Txg1knHwi4cPZGeiEbF9
    GykX/QqjKJLHi3nOXAjNtafM8wKVLc311vjJFhD01PNUk2jYvo00iP6E+ao2er0Qbkz9frW
    S7i/byMIXpDGuDr9hzamWPD9MlUhWgSFdWbBavXMDdBzmTSqBmff6wdNK+td"""
    s = str(zlib.decompress(base64.b64decode(bytes(s, encoding="ascii"))))
    s = re.sub(r"\d", (lambda mo: _event_names[int(mo.group(0))]), s)
    s = re.sub(r"([|&^])", r" \1 ", s)
    s = tuple("event(%s)" % x for x in s.split(";"))
    def event_repr(n):
        """return a human readable, and evaluable representation of an event
        @ event: an integer (modulo 128)
        """
        return s[n & 127]
    return event_repr
event_repr = event_repr(_event_names) # overwrite event_repr()

class _MockDict(object):
    "Helper class for walk() in the tree mode"
    def __getitem__(self, key):
        pass
    def __setitem__(self, key, value):
        pass
    def __contains__(self, key):
        pass
 
def walk(node, gen_subnodes, event = enter, reverse_path = False, tree=True):
    """Traverse a tree or a graph based at 'node' and generate a sequence
    of paths in the graph from the initial node to the visited node.

    The arguments are
    
        @ node : an arbitrary python object used as root node.
        @ gen_subnodes : a function defining the graph structure. It must
            have the interface gen_subnodes(node) --> iterable containing
            other nodes. This function will be called with the initial
            node and the descendent nodes that it generates through
            this function.
        @ event: an integral value specifying which paths will be generated
            during the depth-first walk. This is usually a value obtained
            by composing the walk events (see below) with bitwise operators.
            For example passing event = event(enter|leaf|bounce) will
            generate inner nodes the first time they are entered, leaf
            nodes and all the nodes every time they are revisited during
            the walk.
        @ reverse_path: a boolean indicating that the path should be read
            from right to left (defaults to False).
        @ tree: a boolean indicating that the walked graph is a tree,
            which means that applying gen_subnodes() will only generate
            new nodes (defaults to True). Passing True if the graph
            is not a tree will walk multiple subgraphs several times,
            or lead to an infinite walk and a memory error if the graph
            contains cycles. When a False value is given, this function
            stores all the previoulsy visited nodes during the walk.
            When a True value is given, only the nodes in the current
            path are stored.
    
    Typical use:
        
        for path in walk(node, func, event(enter|leaf)):
            # this choice of events results in a preorder traversal
            visited = path[-1]
            if path.event & leaf:
                print(visited, 'is a leaf node!')
                
    The generated 'path' is a read-only sequence of nodes with path[0] being
    the base node of the walk and path[-1] being the visited node. If
    reverse_path is set to True, the path will appear from right to left,
    with the visited node in position 0. During the whole walk, the function
    generates the same path object, each time in a different state.
    Internally, this path is implemented using a collections.deque object,
    which means that indexing an element in the middle of the path (but not
    near both ends) may require a time proportional to its length.
    
    The generated paths have an attribute path.event which value is an
    integer in the range [0,128[ representing a bitwise combination of
    the base events (which are also integers) explained below
    
        enter:  the currently visited node is an inner node of the tree
                generated before this node's subgraph is visited.
        within: the currently visited node is an inner node generated after
                its first subgraph has been visited but before the other
                subgraphs.
        exit:   the currently visited node is an inner node generated after
                all its subgraphs have been visited.
        leaf:   the currently visited node is a leaf node.
        inner:  the currently visited node is an inner node
        cycle:  the currently visited node is an internal node already on
                the path, which means that the graph has a cycle. The subgraph
                based on this node will not be walked.
        bounce: the currently visited node is either an internal node which
                subgraph has already been walked, or a leaf already met.
                Subgraphs are never walked a twice with the argument tree=False.

    The actual events generated are often a combination of these events, for
    exemple, one may have a value of event(leaf & ~bounce). This attribute
    path.event is best tested with bitwise operators. For example to test if
    the walk is on a leaf, use 'if path.event & leaf:'.
    
    The constant events are also attributes of the walk function, namely
    (walk.enter, walk.within, ...)
    """
    mask, selector = parse_event_arg(event)
    isub = selector.index('', 1)
    ileft = selector.index('', isub + 1)
    tcycle = mask & cycle
    tleaf = mask & leaf
    tibounce = mask & bounce & inner
    tfbounce = mask & bounce & leaf
    tffirst = mask & ~bounce & leaf
    todo = deque((iter((node,)),))
    path = deque()
    const_path = ConstSequence(path)
    if reverse_path:
        ppush, ppop, ivisited = path.appendleft, path.popleft, 0
    else:
        ppush, ppop, ivisited = path.append, path.pop, -1
    less, more = todo.pop, todo.extend
    hist = _MockDict() if tree else dict()
    try:
        while True:
            sequence = todo[-1]
            if sequence.__class__ is _Int:
                less()
                if sequence is _pop:
                    # this node's subtree is exhausted, prepare for bounce
                    hist[path[ivisited]] = tibounce
                    ppop()
                else:
                    const_path.event = sequence
                    yield const_path
            else:
                try:
                    node = next(sequence)
                except StopIteration:
                    less()
                else:
                    ppush(node)
                    # if node in history, generate a bounce event
                    # (actually one of (leaf & bounce, inner & bounce, cycle))
                    if node in hist:
                        const_path.event = hist[node]
                        if const_path.event:
                            yield const_path
                        ppop()
                    else:
                        sub = iter(gen_subnodes(node))
                        try:
                            snode = next(sub)
                        except StopIteration:
                            hist[node] = tfbounce
                            if tleaf:
                                const_path.event = tffirst
                                yield const_path
                            ppop()
                        else:
                            # ajouter node 
                            hist[node] = tcycle
                            selector[ileft] = iter((snode,))
                            selector[isub] = sub
                            more(selector)
    except IndexError:
        if todo: # this allows gen_subnodes() to raise IndexError
            raise

for _e in _named_events:
    setattr(walk, _e.name, _e.value)

if __name__ == "__main__":
    
    def _graph_example(n=4):
        from string import ascii_uppercase as labels
        from random import Random
        n = min(n, 26)
        
        class Node(object):
            def __init__(self, letter):
                self.letter = str(letter)
                self.neigh = list()
            def __str__(self):
                return self.letter
            __repr__ = __str__
        
        # create a reproductible random graph
        nodes = [Node(x) for x in labels[:n]]
        ran = Random()
        ran.seed(6164554331563)
        neighmax = 3
        for n in nodes:
            n.neigh[:] = sorted((x for x in ran.sample(nodes, neighmax)
                                    if x is not n), key=lambda n: n.letter)
        #for n in nodes:
        #    print(n, ":", list(n.neigh))
        for path in walk(nodes[0], (lambda n: n.neigh), event(~0), tree=False):
            print(list(path), "{0:<7}".format(event_repr(path.event)))
        
    def _tree_example():
        # an example tree
        root = (
            ((1,2), (4,5), 6),
            (7, 9),
        )
    
        # a function to generates subnodes for this tree
        def subn(node):
            return node if isinstance(node, tuple) else ()
        
        # use of the walk() generator to traverse the tree
        for path in walk(root, subn, event(enter|exit|leaf)):
            print(list(path), "{0:<7}".format(event_repr(path.event)))
  
    _graph_example(7)
    #_tree_example()
       
""" example code output --->
# this example shows all the possible walk events for the graph shown
# in the attached image when starting from node A
[A] event(enter)
[A, B] event(enter)
[A, B, C] event(enter)
[A, B, C, D] event(enter)
[A, B, C, D, B] event(cycle)
[A, B, C, D] event(within)
[A, B, C, D, F] event(enter)
[A, B, C, D, F, C] event(cycle)
[A, B, C, D, F] event(within)
[A, B, C, D, F, G] event(enter)
[A, B, C, D, F, G, B] event(cycle)
[A, B, C, D, F, G] event(within)
[A, B, C, D, F, G, D] event(cycle)
[A, B, C, D, F, G, E] event(enter)
[A, B, C, D, F, G, E, C] event(cycle)
[A, B, C, D, F, G, E] event(within)
[A, B, C, D, F, G, E, D] event(cycle)
[A, B, C, D, F, G, E, G] event(cycle)
[A, B, C, D, F, G, E] event(exit)
[A, B, C, D, F, G] event(exit)
[A, B, C, D, F] event(exit)
[A, B, C, D] event(exit)
[A, B, C] event(within)
[A, B, C, G] event(inner & bounce)
[A, B, C] event(exit)
[A, B] event(within)
[A, B, E] event(inner & bounce)
[A, B, G] event(inner & bounce)
[A, B] event(exit)
[A] event(within)
[A, C] event(inner & bounce)
[A, G] event(inner & bounce)
[A] event(exit)
"""

Edited 5 Years Ago by Gribouillis: n/a

Attachments example.png 33.82 KB
The article starter has earned a lot of community kudos, and such articles offer a bounty for quality replies.