def testAddTree():
g = graph.Graph()
a = None
nodes = g.add_tree((a, a, (a, a, a)))
assert len(g.nodes) == 5
assert len(g.edges) == 4
out_deg = graph.recursive_map(lambda x: x.out_degree(), nodes)
assert out_deg == [2, 0, [2, 0, 0]]
in_deg = graph.recursive_map(lambda x: x.in_degree(), nodes)
assert in_deg == [0, 1, [1, 1, 1]]
def testAddTree():
g = graph.Graph()
a = None
nodes = g.add_tree( (a, a, (a, a, a)) )
assert len(g.nodes)==5
assert len(g.edges)==4
out_deg = graph.recursive_map(lambda x: x.out_degree(), nodes)
assert out_deg==[2,0,[2,0,0]]
in_deg = graph.recursive_map(lambda x: x.in_degree(), nodes)
assert in_deg==[0,1,[1,1,1]]
def testConnectedComponents():
g = graph.Graph()
nds0 = g.add_tree((1, 1, 1))
nds1 = g.add_tree((2, 2, 2))
comps = g.connected_components()
comps = graph.recursive_map(lambda x: x.data, comps)
assert len(comps) == 2
assert comps[0] == [1, 1, 1]
assert comps[1] == [2, 2, 2]
assert not g.is_weakly_connected()
# connect graph
g.add_edge(nds0[0], nds1[0])
assert g.is_weakly_connected()
def testConnectedComponents():
g = graph.Graph()
nds0 = g.add_tree( (1, 1, 1) )
nds1 = g.add_tree( (2, 2, 2) )
comps = g.connected_components()
comps = graph.recursive_map(lambda x: x.data, comps)
assert len(comps)==2
assert comps[0]==[1,1,1]
assert comps[1]==[2,2,2]
assert not g.is_weakly_connected()
# connect graph
g.add_edge(nds0[0], nds1[0])
assert g.is_weakly_connected()
