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

import numpy


class TestDispatchPyGraph(unittest.TestCase):

    class_type = "PyGraph"

    def setUp(self):
        super().setUp()
        if self.class_type == "PyGraph":
            self.graph = retworkx.undirected_gnp_random_graph(10, .5, seed=42)
        else:
            self.graph = retworkx.directed_gnp_random_graph(10, .5, seed=42)

    def test_distance_matrix(self):
        res = retworkx.distance_matrix(self.graph)
        self.assertIsInstance(res, numpy.ndarray)

    def test_distance_matrix_as_undirected(self):
        if self.class_type == "PyGraph":
            with self.assertRaises(TypeError):
                retworkx.distance_matrix(self.graph, as_undirected=True)
        else:
            res = retworkx.distance_matrix(self.graph, as_undirected=True)
            self.assertIsInstance(res, numpy.ndarray)

    def test_adjacency_matrix(self):
        res = retworkx.adjacency_matrix(self.graph)
        self.assertIsInstance(res, numpy.ndarray)

    def test_all_simple_paths(self):
        res = retworkx.all_simple_paths(self.graph, 0, 1)
        self.assertIsInstance(res, list)

    def test_floyd_warshall_numpy(self):
        res = retworkx.floyd_warshall_numpy(self.graph)
        self.assertIsInstance(res, numpy.ndarray)

    def test_astar_shortest_path(self):
        res = retworkx.astar_shortest_path(self.graph, 0, lambda _: True,
                                           lambda _: 1, lambda _: 1)
        self.assertIsInstance(list(res), list)

    def test_dijkstra_shortest_paths(self):
        res = retworkx.dijkstra_shortest_paths(self.graph, 0)
        self.assertIsInstance(res, dict)

    def test_dijkstra_shortest_path_lengths(self):
        res = retworkx.dijkstra_shortest_path_lengths(self.graph, 0,
                                                      lambda _: 1)
        self.assertIsInstance(res, dict)

    def test_k_shortest_path_lengths(self):
        res = retworkx.k_shortest_path_lengths(self.graph, 0, 2, lambda _: 1)
        self.assertIsInstance(res, dict)

    def test_dfs_edges(self):
        res = retworkx.dfs_edges(self.graph, 0)
        self.assertIsInstance(list(res), list)


class TestDispatchPyDiGraph(TestDispatchPyGraph):

    class_type = "PyDiGraph"