environment/share/doc/ipython/examples/parallel/dagdeps.py
def add_children(G, parent, level, n=2):
    """Add children recursively to a binary tree."""
    if level == 0:
        return
    for i in range(n):
        child = parent+str(i)
        G.add_node(child)
        G.add_edge(parent,child)
        add_children(G, child, level-1, n)
def add_children(G, parent, level, n=2):
    if level == 0:
        return
    for i in range(n):
        child = parent+str(i)
        G.add_node(child)
        G.add_edge(parent,child)
        add_children(G, child, level-1, n)
def add_children ( G , parent , level , n = 2 ) : if level == 0 : return for i in range ( n ) : child = parent + str ( i ) G . add_node ( child ) G . add_edge ( parent , child ) add_children ( G , child , level - 1 , n )
Add children recursively to a binary tree.
Add children recursively to a binary tree .