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

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

    def test_directed_cycle_graph(self):
        graph = retworkx.generators.directed_cycle_graph(20)
        self.assertEqual(len(graph), 20)
        self.assertEqual(len(graph.edges()), 20)
        for i in range(19):
            self.assertEqual(graph.out_edges(i), [(i, i + 1, None)])
        self.assertEqual(graph.out_edges(19), [(19, 0, None)])

    def test_directed_cycle_graph_weights(self):
        graph = retworkx.generators.directed_cycle_graph(
            weights=list(range(20)))
        self.assertEqual(len(graph), 20)
        self.assertEqual([x for x in range(20)], graph.nodes())
        self.assertEqual(len(graph.edges()), 20)
        for i in range(19):
            self.assertEqual(graph.out_edges(i), [(i, i + 1, None)])
        self.assertEqual(graph.out_edges(19), [(19, 0, None)])

    def test_directed_cycle_graph_bidirectional(self):
        graph = retworkx.generators.directed_cycle_graph(
            20, bidirectional=True)
        self.assertEqual(graph.out_edges(0), [(0, 19, None), (0, 1, None)])
        self.assertEqual(graph.in_edges(0), [(19, 0, None), (1, 0, None)])
        for i in range(1, 19):
            self.assertEqual(
                graph.out_edges(i), [(i, i + 1, None), (i, i - 1, None)])
            self.assertEqual(
                graph.in_edges(i), [(i + 1, i, None), (i - 1, i, None)])
        self.assertEqual(graph.out_edges(19), [(19, 0, None), (19, 18, None)])
        self.assertEqual(graph.in_edges(19), [(0, 19, None), (18, 19, None)])

    def test_cycle_directed_no_weights_or_num(self):
        with self.assertRaises(IndexError):
            retworkx.generators.directed_cycle_graph()

    def test_cycle_graph(self):
        graph = retworkx.generators.cycle_graph(20)
        self.assertEqual(len(graph), 20)
        self.assertEqual(len(graph.edges()), 20)

    def test_cycle_graph_weights(self):
        graph = retworkx.generators.cycle_graph(weights=list(range(20)))
        self.assertEqual(len(graph), 20)
        self.assertEqual([x for x in range(20)], graph.nodes())
        self.assertEqual(len(graph.edges()), 20)

    def test_cycle_no_weights_or_num(self):
        with self.assertRaises(IndexError):
            retworkx.generators.cycle_graph()