retworkx 0.8.0

A python graph library implemented in Rust
Documentation 
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

# Licensed under the Apache License, Version 2.0 (the "License"); you may
# not use this file except in compliance with the License. You may obtain
# a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
# License for the specific language governing permissions and limitations
# under the License.

import unittest

import retworkx


class TestNodes(unittest.TestCase):

    def test_nodes(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        graph.add_node('b')
        res = graph.nodes()
        self.assertEqual(['a', 'b'], res)
        self.assertEqual([0, 1], graph.node_indexes())

    def test_no_nodes(self):
        graph = retworkx.PyGraph()
        self.assertEqual([], graph.nodes())
        self.assertEqual([], graph.node_indexes())

    def test_remove_node(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_node('c')
        graph.remove_node(node_b)
        res = graph.nodes()
        self.assertEqual(['a', 'c'], res)
        self.assertEqual([0, 2], graph.node_indexes())

    def test_remove_node_invalid_index(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        graph.add_node('b')
        graph.add_node('c')
        graph.remove_node(76)
        res = graph.nodes()
        self.assertEqual(['a', 'b', 'c'], res)
        self.assertEqual([0, 1, 2], graph.node_indexes())

    def test_remove_nodes_from(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        node_c = graph.add_node('c')
        graph.add_edge(node_b, node_c, "Edgy_mk2")
        graph.remove_nodes_from([node_b, node_c])
        res = graph.nodes()
        self.assertEqual(['a'], res)
        self.assertEqual([0], graph.node_indexes())

    def test_remove_nodes_from_with_invalid_index(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        node_c = graph.add_node('c')
        graph.add_edge(node_b, node_c, "Edgy_mk2")
        graph.remove_nodes_from([node_b, node_c, 76])
        res = graph.nodes()
        self.assertEqual(['a'], res)
        self.assertEqual([0], graph.node_indexes())

    def test_get_node_data(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        node_b = graph.add_node('b')
        self.assertEqual('b', graph.get_node_data(node_b))

    def test_get_node_data_bad_index(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        graph.add_node('b')
        self.assertRaises(IndexError, graph.get_node_data, 42)

    def test_pygraph_length(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, 'An_edge')
        self.assertEqual(2, len(graph))

    def test_pygraph_length_empty(self):
        graph = retworkx.PyGraph()
        self.assertEqual(0, len(graph))

    def test_add_nodes_from(self):
        graph = retworkx.PyGraph()
        nodes = list(range(100))
        res = graph.add_nodes_from(nodes)
        self.assertEqual(len(res), 100)
        self.assertEqual(res, nodes)

    def test_add_node_from_empty(self):
        graph = retworkx.PyGraph()
        res = graph.add_nodes_from([])
        self.assertEqual(len(res), 0)

    def test_get_node_data_getitem(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        self.assertEqual('b', graph[node_b])

    def test_get_node_data_getitem_bad_index(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        with self.assertRaises(IndexError):
            graph[42]

    def test_set_node_data_setitem(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        graph[node_b] = 'Oh so cool'
        self.assertEqual('Oh so cool', graph[node_b])

    def test_set_node_data_setitem_bad_index(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        with self.assertRaises(IndexError):
            graph[42] = 'Oh so cool'

    def test_remove_node_delitem(self):
        graph = retworkx.PyGraph()
        node_a = graph.add_node('a')
        node_b = graph.add_node('b')
        graph.add_edge(node_a, node_b, "Edgy")
        node_c = graph.add_node('c')
        graph.add_edge(node_b, node_c, "Edgy_mk2")
        del graph[node_b]
        res = graph.nodes()
        self.assertEqual(['a', 'c'], res)
        self.assertEqual([0, 2], graph.node_indexes())

    def test_remove_node_delitem_invalid_index(self):
        graph = retworkx.PyGraph()
        graph.add_node('a')
        graph.add_node('b')
        graph.add_node('c')
        with self.assertRaises(IndexError):
            del graph[76]
        res = graph.nodes()
        self.assertEqual(['a', 'b', 'c'], res)
        self.assertEqual([0, 1, 2], graph.node_indexes())