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

# 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 TestAdj(unittest.TestCase):
    def test_single_neighbor(self):
        dag = retworkx.PyDAG()
        node_a = dag.add_node('a')
        node_b = dag.add_child(node_a, 'b', {'a': 1})
        node_c = dag.add_child(node_a, 'c', {'a': 2})
        res = dag.neighbors(node_a)
        self.assertCountEqual([node_c, node_b], res)

    def test_unique_neighbors_on_dags(self):
        dag = retworkx.PyDAG()
        node_a = dag.add_node('a')
        node_b = dag.add_child(node_a, 'b', ['edge a->b'])
        node_c = dag.add_child(node_a, 'c', ['edge a->c'])
        dag.add_edge(node_a, node_b, ['edge a->b bis'])
        res = dag.neighbors(node_a)
        self.assertCountEqual([node_c, node_b], res)

    def test_unique_neighbors_on_graphs(self):
        dag = retworkx.PyGraph()
        node_a = dag.add_node('a')
        node_b = dag.add_node('b')
        node_c = dag.add_node('c')
        dag.add_edge(node_a, node_b, ['edge a->b'])
        dag.add_edge(node_a, node_b, ['edge a->b bis'])
        dag.add_edge(node_a, node_c, ['edge a->c'])
        res = dag.neighbors(node_a)
        self.assertCountEqual([node_c, node_b], res)

    def test_single_neighbor_dir(self):
        dag = retworkx.PyDAG()
        node_a = dag.add_node('a')
        node_b = dag.add_child(node_a, 'b', {'a': 1})
        node_c = dag.add_child(node_a, 'c', {'a': 2})
        res = dag.successor_indices(node_a)
        self.assertEqual([node_c, node_b], res)
        res = dag.predecessor_indices(node_a)
        self.assertEqual([], res)

    def test_neighbor_dir_surrounded(self):
        dag = retworkx.PyDAG()
        node_a = dag.add_node('a')
        node_b = dag.add_child(node_a, 'b', {'a': 1})
        node_c = dag.add_child(node_b, 'c', {'a': 2})
        res = dag.successor_indices(node_b)
        self.assertEqual([node_c], res)
        res = dag.predecessor_indices(node_b)
        self.assertEqual([node_a], res)

    def test_no_neighbor(self):
        dag = retworkx.PyDAG()
        node_a = dag.add_node('a')
        self.assertEqual([], dag.neighbors(node_a))