49 |
|
|
50 |
assert Traversals.isConnected(a, p, d, fen.constgraph) |
assert Traversals.isConnected(a, p, d, fen.constgraph) |
51 |
assert Traversals.isConnected(d, p, a, fen.constgraph) |
assert Traversals.isConnected(d, p, a, fen.constgraph) |
52 |
|
|
53 |
|
|
54 |
|
def testfindComponents(): |
55 |
|
fen = ff.test.fen.newFen() |
56 |
|
p = ff.swamp.Nodes.N() |
57 |
|
q = ff.swamp.Nodes.N() |
58 |
|
|
59 |
|
a = ff.swamp.Nodes.N() |
60 |
|
b = ff.swamp.Nodes.N() |
61 |
|
c = ff.swamp.Nodes.N() |
62 |
|
d = ff.swamp.Nodes.N() |
63 |
|
|
64 |
|
# Introduce the nodes into graph |
65 |
|
fen.graph.add(a,q,b) |
66 |
|
fen.graph.add(c,q,d) |
67 |
|
|
68 |
|
## no XAA problem if all nodes are subjects |
69 |
|
# fen.graph.add(b,q,c) |
70 |
|
# fen.graph.add(d,q,a) |
71 |
|
|
72 |
|
result = Traversals.findComponents(p, fen.constgraph) |
73 |
|
nodes = fen.constgraph.findN_XAA_Iter() |
74 |
|
print "XAA doesn't find objects:" |
75 |
|
while nodes.hasNext(): |
76 |
|
print nodes.next() |
77 |
|
print result |
78 |
|
for x in a, b, c, d: # all single nodes are components |
79 |
|
assert result.contains(x) |
80 |
|
|
81 |
|
fen.graph.add(a,p,b) |
82 |
|
|
83 |
|
result = Traversals.findComponents(p, fen.constgraph) |
84 |
|
assert result.contains(a) != result.contains(b) # Either is representative |
85 |
|
|
86 |
|
fen.graph.add(a,p,c) |
87 |
|
|
88 |
|
result = Traversals.findComponents(p, fen.constgraph) |
89 |
|
assert result.contains(a) # a has higher degree than b or c |
90 |
|
assert not result.contains(b) |
91 |
|
assert not result.contains(c) |
92 |
|
|
93 |
|
fen.graph.add(c,p,b) |
94 |
|
fen.graph.add(d,p,b) |
95 |
|
|
96 |
|
result = Traversals.findComponents(p, fen.constgraph) |
97 |
|
assert result.contains(b) # b has highest degree |
98 |
|
for x in a, c, d: |
99 |
|
assert not result.contains(x) |
100 |
|
|