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

# 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 TestDfsEdges(unittest.TestCase):
    def test_graph_dfs_edges(self):
        graph = retworkx.PyGraph()
        graph.extend_from_edge_list([(0, 1), (1, 2), (1, 3), (2, 4), (3, 4)])
        edges = retworkx.graph_dfs_edges(graph, 0)
        expected = [(0, 1), (1, 2), (2, 4), (4, 3)]
        self.assertEqual(expected, edges)

    def test_digraph_dfs_edges(self):
        graph = retworkx.PyDiGraph()
        graph.extend_from_edge_list([(0, 1), (1, 2), (1, 3), (2, 4), (3, 4)])
        edges = retworkx.digraph_dfs_edges(graph, 0)
        expected = [(0, 1), (1, 2), (2, 4), (1, 3)]
        self.assertEqual(expected, edges)

    def test_graph_disconnected_dfs_edges(self):
        graph = retworkx.PyGraph()
        graph.extend_from_edge_list([(0, 1), (2, 3)])
        edges = retworkx.graph_dfs_edges(graph)
        expected = [(0, 1), (2, 3)]
        self.assertEqual(expected, edges)

    def test_digraph_disconnected_dfs_edges(self):
        graph = retworkx.PyDiGraph()
        graph.extend_from_edge_list([(0, 1), (2, 3)])
        edges = retworkx.digraph_dfs_edges(graph)
        expected = [(0, 1), (2, 3)]
        self.assertEqual(expected, edges)