示例#1
0
def test_add_tree():
    t1 = regular_tree(Tree(), 0, nb_vertices=20)
    t2 = regular_tree(Tree(), 0, nb_vertices=18)

    t = t1.copy()

    n1 = len(t1)
    n = len(t1) + len(t2)
    t1.add_child_tree(20, t2)
    assert len(t1) == n
    
    t1.remove_tree(21)
    assert list(pre_order(t,0)) == list(pre_order(t1,0))
示例#2
0
def test_add_tree():
    t1 = regular_tree(Tree(), 0, nb_vertices=20)
    t2 = regular_tree(Tree(), 0, nb_vertices=18)

    t = t1.copy()

    n1 = len(t1)
    n = len(t1) + len(t2)
    t1.add_child_tree(20, t2)
    assert len(t1) == n

    t1.remove_tree(21)
    assert list(pre_order(t, 0)) == list(pre_order(t1, 0))
示例#3
0
def test_preorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(pre_order(g, g.root))
    assert len(l) == len(g)
    for i, vid in enumerate(l):
        if vid != g.root:
            assert g.parent(vid) in l[:i], 'vid: '+str(vid) + ' i: ' +str(i)+' : '+ str(l)
示例#4
0
def test_postorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(post_order(g, g.root))
    assert len(l) == len(g)
    for i, vid in enumerate(l):
        if vid != g.root:
            assert g.parent(vid) not in l[:i]
示例#5
0
def test_postorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(post_order(g, g.root))
    assert len(l) == len(g)
    for i, vid in enumerate(l):
        if vid != g.root:
            assert g.parent(vid) not in l[:i]
示例#6
0
def test_preorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(pre_order(g, g.root))
    assert len(l) == len(g)
    for i, vid in enumerate(l):
        if vid != g.root:
            assert g.parent(vid) in l[:i], 'vid: ' + str(vid) + ' i: ' + str(
                i) + ' : ' + str(l)
示例#7
0
def setup_func () :
    global g
    g = regular_tree(Tree(), 0, nb_vertices=19)
示例#8
0
def test_levelorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(level_order(g, g.root))
    assert len(l) == len(g)
    assert l == range(len(g))
示例#9
0
def setup_func():
    global g
    g = regular_tree(Tree(), 0, nb_vertices=19)
示例#10
0
def test_levelorder():
    g = regular_tree(Tree(), 0, nb_vertices=50)
    l = list(level_order(g, g.root))
    assert len(l) == len(g)
    assert l == range(len(g))