def test_hash(self):
res = retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn)
hash_res = hash(res)
self.assertIsInstance(hash_res, int)
# Assert hash is stable
self.assertEqual(hash_res, hash(res))
def test_index_error(self):
res = retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn)
with self.assertRaises(IndexError):
res[42]
def test_pickle(self):
paths = retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn)
paths_pickle = pickle.dumps(paths)
paths_copy = pickle.loads(paths_pickle)
self.assertEqual(paths, paths_copy)
def test_str(self):
res = retworkx.dijkstra_shortest_path_lengths(self.dag, 0,
lambda _: 3.14)
self.assertEqual("PathLengthMapping{1: 3.14}", str(res))
def test_not_contains(self):
res = retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn)
self.assertNotIn(0, res)
def test__eq__not_match_values(self):
self.assertFalse(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) ==
{1: 2.0})
def test__ne__different_length(self):
self.assertTrue(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) != {
1: 1.0,
2: 2.0
})
def test_items(self):
items = retworkx.dijkstra_shortest_path_lengths(self.dag, 0,
self.fn).items()
self.assertEqual([(1, 1.0)], list(items))
def test__ne__match(self):
self.assertFalse(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) !=
{1: 1.0})
def test__ne__not_match_values(self):
self.assertTrue(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) !=
{1: 2.0})
def test__eq__invalid_inner_type(self):
self.assertFalse(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) ==
{0: "a"})
def test_eq__same_type(self):
self.assertEqual(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn),
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn),
)
def test__eq__different_length(self):
self.assertFalse(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) == {
1: 1.0,
2: 2.0
})
def test_keys(self):
keys = retworkx.dijkstra_shortest_path_lengths(self.dag, 0,
self.fn).keys()
self.assertEqual([1], list(keys))
def test__ne__invalid_type(self):
self.assertTrue(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) !=
["a", None])
def test_values(self):
values = retworkx.dijkstra_shortest_path_lengths(self.dag, 0,
self.fn).values()
self.assertEqual([1.0], list(values))
def test__gt__not_implemented(self):
with self.assertRaises(NotImplementedError):
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) > {
1: 1.0
}
def test_iter(self):
mapping_iter = iter(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn))
output = list(mapping_iter)
self.assertEqual(output, [1])
def test_deepcopy(self):
paths = retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn)
paths_copy = copy.deepcopy(paths)
self.assertEqual(paths, paths_copy)
def test_dijkstra_shortest_path_lengths(self):
res = retworkx.dijkstra_shortest_path_lengths(self.graph, 0,
lambda _: 1)
self.assertIsInstance(res, retworkx.PathLengthMapping)
def test__eq__match(self):
self.assertTrue(
retworkx.dijkstra_shortest_path_lengths(self.dag, 0, self.fn) ==
{1: 1.0})
