1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
import random
import pytest
import networkx as nx
from networkx.utils import arbitrary_element, graphs_equal
@pytest.mark.parametrize("prefix_tree_fn", (nx.prefix_tree, nx.prefix_tree_recursive))
def test_basic_prefix_tree(prefix_tree_fn):
# This example is from the Wikipedia article "Trie"
# <https://en.wikipedia.org/wiki/Trie>.
strings = ["a", "to", "tea", "ted", "ten", "i", "in", "inn"]
T = prefix_tree_fn(strings)
root, NIL = 0, -1
def source_label(v):
return T.nodes[v]["source"]
# First, we check that the tree has the expected
# structure. Recall that each node that corresponds to one of
# the input strings has an edge to the NIL node.
#
# Consider the three children at level 1 in the trie.
a, i, t = sorted(T[root], key=source_label)
# Check the 'a' branch.
assert len(T[a]) == 1
nil = arbitrary_element(T[a])
assert len(T[nil]) == 0
# Check the 'i' branch.
assert len(T[i]) == 2
nil, in_ = sorted(T[i], key=source_label)
assert len(T[nil]) == 0
assert len(T[in_]) == 2
nil, inn = sorted(T[in_], key=source_label)
assert len(T[nil]) == 0
assert len(T[inn]) == 1
nil = arbitrary_element(T[inn])
assert len(T[nil]) == 0
# Check the 't' branch.
te, to = sorted(T[t], key=source_label)
assert len(T[to]) == 1
nil = arbitrary_element(T[to])
assert len(T[nil]) == 0
tea, ted, ten = sorted(T[te], key=source_label)
assert len(T[tea]) == 1
assert len(T[ted]) == 1
assert len(T[ten]) == 1
nil = arbitrary_element(T[tea])
assert len(T[nil]) == 0
nil = arbitrary_element(T[ted])
assert len(T[nil]) == 0
nil = arbitrary_element(T[ten])
assert len(T[nil]) == 0
# Next, we check that the "sources" of each of the nodes is the
# rightmost letter in the string corresponding to the path to
# that node.
assert source_label(root) is None
assert source_label(a) == "a"
assert source_label(i) == "i"
assert source_label(t) == "t"
assert source_label(in_) == "n"
assert source_label(inn) == "n"
assert source_label(to) == "o"
assert source_label(te) == "e"
assert source_label(tea) == "a"
assert source_label(ted) == "d"
assert source_label(ten) == "n"
assert source_label(NIL) == "NIL"
@pytest.mark.parametrize(
"strings",
(
["a", "to", "tea", "ted", "ten", "i", "in", "inn"],
["ab", "abs", "ad"],
["ab", "abs", "ad", ""],
["distant", "disparaging", "distant", "diamond", "ruby"],
),
)
def test_implementations_consistent(strings):
"""Ensure results are consistent between prefix_tree implementations."""
assert graphs_equal(nx.prefix_tree(strings), nx.prefix_tree_recursive(strings))
def test_random_labeled_rooted_tree():
for i in range(1, 10):
t1 = nx.random_labeled_rooted_tree(i, seed=42)
t2 = nx.random_labeled_rooted_tree(i, seed=42)
assert nx.utils.misc.graphs_equal(t1, t2)
assert nx.is_tree(t1)
assert "root" in t1.graph
assert "roots" not in t1.graph
def test_random_labeled_tree_n_zero():
"""Tests if n = 0 then the NetworkXPointlessConcept exception is raised."""
with pytest.raises(nx.NetworkXPointlessConcept):
T = nx.random_labeled_tree(0, seed=1234)
with pytest.raises(nx.NetworkXPointlessConcept):
T = nx.random_labeled_rooted_tree(0, seed=1234)
def test_random_labeled_rooted_forest():
for i in range(1, 10):
t1 = nx.random_labeled_rooted_forest(i, seed=42)
t2 = nx.random_labeled_rooted_forest(i, seed=42)
assert nx.utils.misc.graphs_equal(t1, t2)
for c in nx.connected_components(t1):
assert nx.is_tree(t1.subgraph(c))
assert "root" not in t1.graph
assert "roots" in t1.graph
def test_random_labeled_rooted_forest_n_zero():
"""Tests generation of empty labeled forests."""
F = nx.random_labeled_rooted_forest(0, seed=1234)
assert len(F) == 0
assert len(F.graph["roots"]) == 0
def test_random_unlabeled_rooted_tree():
for i in range(1, 10):
t1 = nx.random_unlabeled_rooted_tree(i, seed=42)
t2 = nx.random_unlabeled_rooted_tree(i, seed=42)
assert nx.utils.misc.graphs_equal(t1, t2)
assert nx.is_tree(t1)
assert "root" in t1.graph
assert "roots" not in t1.graph
t = nx.random_unlabeled_rooted_tree(15, number_of_trees=10, seed=43)
random.seed(43)
s = nx.random_unlabeled_rooted_tree(15, number_of_trees=10, seed=random)
for i in range(10):
assert nx.utils.misc.graphs_equal(t[i], s[i])
assert nx.is_tree(t[i])
assert "root" in t[i].graph
assert "roots" not in t[i].graph
def test_random_unlabeled_tree_n_zero():
"""Tests if n = 0 then the NetworkXPointlessConcept exception is raised."""
with pytest.raises(nx.NetworkXPointlessConcept):
T = nx.random_unlabeled_tree(0, seed=1234)
with pytest.raises(nx.NetworkXPointlessConcept):
T = nx.random_unlabeled_rooted_tree(0, seed=1234)
def test_random_unlabeled_rooted_forest():
with pytest.raises(ValueError):
nx.random_unlabeled_rooted_forest(10, q=0, seed=42)
for i in range(1, 10):
for q in range(1, i + 1):
t1 = nx.random_unlabeled_rooted_forest(i, q=q, seed=42)
t2 = nx.random_unlabeled_rooted_forest(i, q=q, seed=42)
assert nx.utils.misc.graphs_equal(t1, t2)
for c in nx.connected_components(t1):
assert nx.is_tree(t1.subgraph(c))
assert len(c) <= q
assert "root" not in t1.graph
assert "roots" in t1.graph
t = nx.random_unlabeled_rooted_forest(15, number_of_forests=10, seed=43)
random.seed(43)
s = nx.random_unlabeled_rooted_forest(15, number_of_forests=10, seed=random)
for i in range(10):
assert nx.utils.misc.graphs_equal(t[i], s[i])
for c in nx.connected_components(t[i]):
assert nx.is_tree(t[i].subgraph(c))
assert "root" not in t[i].graph
assert "roots" in t[i].graph
def test_random_unlabeled_forest_n_zero():
"""Tests generation of empty unlabeled forests."""
F = nx.random_unlabeled_rooted_forest(0, seed=1234)
assert len(F) == 0
assert len(F.graph["roots"]) == 0
def test_random_unlabeled_tree():
for i in range(1, 10):
t1 = nx.random_unlabeled_tree(i, seed=42)
t2 = nx.random_unlabeled_tree(i, seed=42)
assert nx.utils.misc.graphs_equal(t1, t2)
assert nx.is_tree(t1)
assert "root" not in t1.graph
assert "roots" not in t1.graph
t = nx.random_unlabeled_tree(10, number_of_trees=10, seed=43)
random.seed(43)
s = nx.random_unlabeled_tree(10, number_of_trees=10, seed=random)
for i in range(10):
assert nx.utils.misc.graphs_equal(t[i], s[i])
assert nx.is_tree(t[i])
assert "root" not in t[i].graph
assert "roots" not in t[i].graph
|
