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

# 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 TestStronglyConnected(unittest.TestCase):

    def test_number_strongly_connected_all_strong(self):
        G = retworkx.PyDiGraph()
        node_a = G.add_node(1)
        node_b = G.add_child(node_a, 2, {})
        node_c = G.add_child(node_b, 3, {})
        self.assertEqual(retworkx.strongly_connected_components(G),
                         [[node_c], [node_b], [node_a]])

    def test_number_strongly_connected(self):
        G = retworkx.PyDiGraph()
        node_a = G.add_node(1)
        node_b = G.add_child(node_a, 2, {})
        node_c = G.add_node(3)
        self.assertEqual(retworkx.strongly_connected_components(G),
                         [[node_c], [node_b], [node_a]])

    def test_stongly_connected_no_linear(self):
        G = retworkx.PyDiGraph()
        G.add_nodes_from(list(range(8)))
        G.add_edges_from_no_data([
            (0, 1),
            (1, 2),
            (1, 7),
            (2, 3),
            (2, 6),
            (3, 4),
            (4, 2),
            (4, 5),
            (6, 3),
            (6, 5),
            (7, 0),
            (7, 6),
        ])
        expected = [[5], [2, 3, 4, 6], [0, 1, 7]]
        components = retworkx.strongly_connected_components(G)
        self.assertEqual(components, expected)

    def test_number_strongly_connected_big(self):
        G = retworkx.PyDiGraph()
        for i in range(100000):
            node = G.add_node(i)
            G.add_child(node, str(i), {})
        self.assertEqual(len(retworkx.strongly_connected_components(G)),
                         200000)