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

# 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 TestFindCycle(unittest.TestCase):
    def setUp(self):
        self.graph = retworkx.PyDiGraph()
        self.graph.add_nodes_from(list(range(10)))
        self.graph.add_edges_from_no_data([
            (0, 1),
            (3, 0),
            (0, 5),
            (8, 0),
            (1, 2),
            (1, 6),
            (2, 3),
            (3, 4),
            (4, 5),
            (6, 7),
            (7, 8),
            (8, 9)])

    def test_find_cycle(self):
        graph = retworkx.PyDiGraph()
        graph.add_nodes_from(list(range(6)))
        graph.add_edges_from_no_data([
            (0, 1), (0, 3), (0, 5), (1, 2), (2, 3), (3, 4), (4, 5), (4, 0)
        ])
        res = retworkx.digraph_find_cycle(graph, 0)
        self.assertEqual([(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)], res)

    def test_find_cycle_multiple_roots_same_cycles(self):
        res = retworkx.digraph_find_cycle(self.graph, 0)
        self.assertEqual(res, [(0, 1), (1, 2), (2, 3), (3, 0)])
        res = retworkx.digraph_find_cycle(self.graph, 1)
        self.assertEqual(res, [(1, 2), (2, 3), (3, 0), (0, 1)])
        res = retworkx.digraph_find_cycle(self.graph, 5)
        self.assertEqual(res, [])

    def test_find_cycle_disconnected_graphs(self):
        self.graph.add_nodes_from(["A", "B", "C"])
        self.graph.add_edges_from_no_data([(10, 11), (12, 10), (11, 12)])
        res = retworkx.digraph_find_cycle(self.graph, 0)
        self.assertEqual(res, [(0, 1), (1, 2), (2, 3), (3, 0)])
        res = retworkx.digraph_find_cycle(self.graph, 10)
        self.assertEqual(res, [(10, 11), (11, 12), (12, 10)])

    def test_invalid_types(self):
        graph = retworkx.PyGraph()
        with self.assertRaises(TypeError):
            retworkx.digraph_find_cycle(graph)

    def test_self_loop(self):
        self.graph.add_edge(1, 1, None)
        res = retworkx.digraph_find_cycle(self.graph, 0)
        self.assertEqual([(1, 1)], res)