60 lines
2.1 KiB
Python
60 lines
2.1 KiB
Python
#!/usr/bin/env python
|
|
import pytest
|
|
numpy = pytest.importorskip('numpy')
|
|
npt = pytest.importorskip('numpy.testing')
|
|
|
|
|
|
import networkx as nx
|
|
|
|
|
|
class TestFloydNumpy(object):
|
|
|
|
def test_cycle_numpy(self):
|
|
dist = nx.floyd_warshall_numpy(nx.cycle_graph(7))
|
|
assert dist[0, 3] == 3
|
|
assert dist[0, 4] == 3
|
|
|
|
def test_weighted_numpy_three_edges(self):
|
|
XG3 = nx.Graph()
|
|
XG3.add_weighted_edges_from([[0, 1, 2], [1, 2, 12], [2, 3, 1],
|
|
[3, 4, 5], [4, 5, 1], [5, 0, 10]])
|
|
dist = nx.floyd_warshall_numpy(XG3)
|
|
assert dist[0, 3] == 15
|
|
|
|
def test_weighted_numpy_two_edges(self):
|
|
XG4 = nx.Graph()
|
|
XG4.add_weighted_edges_from([[0, 1, 2], [1, 2, 2], [2, 3, 1],
|
|
[3, 4, 1], [4, 5, 1], [5, 6, 1],
|
|
[6, 7, 1], [7, 0, 1]])
|
|
dist = nx.floyd_warshall_numpy(XG4)
|
|
assert dist[0, 2] == 4
|
|
|
|
def test_weight_parameter_numpy(self):
|
|
XG4 = nx.Graph()
|
|
XG4.add_edges_from([(0, 1, {'heavy': 2}), (1, 2, {'heavy': 2}),
|
|
(2, 3, {'heavy': 1}), (3, 4, {'heavy': 1}),
|
|
(4, 5, {'heavy': 1}), (5, 6, {'heavy': 1}),
|
|
(6, 7, {'heavy': 1}), (7, 0, {'heavy': 1})])
|
|
dist = nx.floyd_warshall_numpy(XG4, weight='heavy')
|
|
assert dist[0, 2] == 4
|
|
|
|
def test_directed_cycle_numpy(self):
|
|
G = nx.DiGraph()
|
|
nx.add_cycle(G, [0, 1, 2, 3])
|
|
pred, dist = nx.floyd_warshall_predecessor_and_distance(G)
|
|
D = nx.utils.dict_to_numpy_array(dist)
|
|
npt.assert_equal(nx.floyd_warshall_numpy(G), D)
|
|
|
|
def test_zero_weight(self):
|
|
G = nx.DiGraph()
|
|
edges = [(1, 2, -2), (2, 3, -4), (1, 5, 1), (5, 4, 0), (4, 3, -5), (2, 5, -7)]
|
|
G.add_weighted_edges_from(edges)
|
|
dist = nx.floyd_warshall_numpy(G)
|
|
assert int(numpy.min(dist)) == -14
|
|
|
|
G = nx.MultiDiGraph()
|
|
edges.append((2, 5, -7))
|
|
G.add_weighted_edges_from(edges)
|
|
dist = nx.floyd_warshall_numpy(G)
|
|
assert int(numpy.min(dist)) == -14
|