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

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

    def test_subgraph(self):
        graph = retworkx.PyDiGraph()
        graph.add_node('a')
        graph.add_node('b')
        graph.add_node('c')
        graph.add_node('d')
        graph.add_edges_from([(0, 1, 1), (0, 2, 2), (0, 3, 3), (1, 3, 4)])
        subgraph = graph.subgraph([1, 3])
        self.assertEqual([(0, 1, 4)], subgraph.weighted_edge_list())
        self.assertEqual(['b', 'd'], subgraph.nodes())

    def test_subgraph_empty_list(self):
        graph = retworkx.PyDiGraph()
        graph.add_node('a')
        graph.add_node('b')
        graph.add_node('c')
        graph.add_node('d')
        graph.add_edges_from([(0, 1, 1), (0, 2, 2), (0, 3, 3), (1, 3, 4)])
        subgraph = graph.subgraph([])
        self.assertEqual([], subgraph.weighted_edge_list())
        self.assertEqual(0, len(subgraph))

    def test_subgraph_invalid_entry(self):
        graph = retworkx.PyDiGraph()
        graph.add_node('a')
        graph.add_node('b')
        graph.add_node('c')
        graph.add_node('d')
        graph.add_edges_from([(0, 1, 1), (0, 2, 2), (0, 3, 3), (1, 3, 4)])
        subgraph = graph.subgraph([42])
        self.assertEqual([], subgraph.weighted_edge_list())
        self.assertEqual(0, len(subgraph))

    def test_subgraph_pass_by_reference(self):
        graph = retworkx.PyDiGraph()
        graph.add_node({'a': 0})
        graph.add_node('b')
        graph.add_node('c')
        graph.add_node('d')
        graph.add_edges_from([(0, 1, 1), (0, 2, 2), (0, 3, 3), (1, 3, 4)])
        subgraph = graph.subgraph([0, 1, 3])
        self.assertEqual([(0, 1, 1), (0, 2, 3), (1, 2, 4)],
                         subgraph.weighted_edge_list())
        self.assertEqual([{'a': 0}, 'b', 'd'], subgraph.nodes())
        graph[0]['a'] = 4
        self.assertEqual(subgraph[0]['a'], 4)

    def test_subgraph_replace_weight_no_reference(self):
        graph = retworkx.PyDiGraph()
        graph.add_node({'a': 0})
        graph.add_node('b')
        graph.add_node('c')
        graph.add_node('d')
        graph.add_edges_from([(0, 1, 1), (0, 2, 2), (0, 3, 3), (1, 3, 4)])
        subgraph = graph.subgraph([0, 1, 3])
        self.assertEqual([(0, 1, 1), (0, 2, 3), (1, 2, 4)],
                         subgraph.weighted_edge_list())
        self.assertEqual([{'a': 0}, 'b', 'd'], subgraph.nodes())
        graph[0] = 4
        self.assertEqual(subgraph[0]['a'], 0)