def test_shortest_path(self): deg = [3, 2, 2, 1] G = nx.generators.havel_hakimi_graph(deg) cs1 = nxt.creation_sequence(deg, with_labels=True) for n, m in [(3, 0), (0, 3), (0, 2), (0, 1), (1, 3), (3, 1), (1, 2), (2, 3)]: assert_equal(nxt.shortest_path(cs1, n, m), nx.shortest_path(G, n, m)) spl = nxt.shortest_path_length(cs1, 3) spl2 = nxt.shortest_path_length([t for v, t in cs1], 2) assert_equal(spl, spl2) spld = {} for j, pl in enumerate(spl): n = cs1[j][0] spld[n] = pl assert_equal(spld, nx.single_source_shortest_path_length(G, 3)) assert_equal(nxt.shortest_path(['d', 'd', 'd', 'i', 'd', 'd'], 1, 2), [1, 2]) assert_equal(nxt.shortest_path([3, 1, 2], 1, 2), [1, 2]) assert_raises(TypeError, nxt.shortest_path, [3., 1., 2.], 1, 2) assert_raises(ValueError, nxt.shortest_path, [3, 1, 2], 'a', 2) assert_raises(ValueError, nxt.shortest_path, [3, 1, 2], 1, 'b') assert_equal(nxt.shortest_path([3, 1, 2], 1, 1), [1])
def test_shortest_path(self): deg = [3, 2, 2, 1] G = nx.generators.havel_hakimi_graph(deg) cs1 = nxt.creation_sequence(deg, with_labels=True) for n, m in [(3, 0), (0, 3), (0, 2), (0, 1), (1, 3), (3, 1), (1, 2), (2, 3)]: assert nxt.shortest_path(cs1, n, m) == nx.shortest_path(G, n, m) spl = nxt.shortest_path_length(cs1, 3) spl2 = nxt.shortest_path_length([t for v, t in cs1], 2) assert spl == spl2 spld = {} for j, pl in enumerate(spl): n = cs1[j][0] spld[n] = pl assert spld == nx.single_source_shortest_path_length(G, 3) assert nxt.shortest_path(["d", "d", "d", "i", "d", "d"], 1, 2) == [1, 2] assert nxt.shortest_path([3, 1, 2], 1, 2) == [1, 2] assert pytest.raises(TypeError, nxt.shortest_path, [3.0, 1.0, 2.0], 1, 2) assert pytest.raises(ValueError, nxt.shortest_path, [3, 1, 2], "a", 2) assert pytest.raises(ValueError, nxt.shortest_path, [3, 1, 2], 1, "b") assert nxt.shortest_path([3, 1, 2], 1, 1) == [1]
def test_shortest_path_length(self): assert_equal(nxt.shortest_path_length([3, 1, 2], 1), [1, 0, 1, 2, 1, 1]) assert_equal(nxt.shortest_path_length(['d', 'd', 'd', 'i', 'd', 'd'], 1), [1, 0, 1, 2, 1, 1]) assert_equal(nxt.shortest_path_length(('d', 'd', 'd', 'i', 'd', 'd'), 1), [1, 0, 1, 2, 1, 1]) assert_raises(TypeError, nxt.shortest_path, [3., 1., 2.], 1)
def test_shortest_path_length(self): assert nxt.shortest_path_length([3, 1, 2], 1) == [1, 0, 1, 2, 1, 1] assert (nxt.shortest_path_length(['d', 'd', 'd', 'i', 'd', 'd'], 1) == [1, 0, 1, 2, 1, 1]) assert (nxt.shortest_path_length(('d', 'd', 'd', 'i', 'd', 'd'), 1) == [1, 0, 1, 2, 1, 1]) assert pytest.raises(TypeError, nxt.shortest_path, [3., 1., 2.], 1)
def test_shortest_path(self): deg=[3,2,2,1] G=nx.generators.havel_hakimi_graph(deg) cs1=nxt.creation_sequence(deg, with_labels=True) for n, m in [(3, 0), (0, 3), (0, 2), (0, 1), (1, 3), (3, 1), (1, 2), (2, 3)]: assert_equal(nxt.shortest_path(cs1,n,m), nx.shortest_path(G, n, m)) spl=nxt.shortest_path_length(cs1,3) spl2=nxt.shortest_path_length([ t for v,t in cs1],2) assert_equal(spl, spl2) spld={} for j,pl in enumerate(spl): n=cs1[j][0] spld[n]=pl assert_equal(spld, nx.single_source_shortest_path_length(G, 3))
def test_shortest_path(self): deg = [3, 2, 2, 1] G = nx.generators.havel_hakimi_graph(deg) cs1 = nxt.creation_sequence(deg, with_labels=True) for n, m in [(3, 0), (0, 3), (0, 2), (0, 1), (1, 3), (3, 1), (1, 2), (2, 3)]: assert_equal(nxt.shortest_path(cs1, n, m), nx.shortest_path(G, n, m)) spl = nxt.shortest_path_length(cs1, 3) spl2 = nxt.shortest_path_length([t for v, t in cs1], 2) assert_equal(spl, spl2) spld = {} for j, pl in enumerate(spl): n = cs1[j][0] spld[n] = pl assert_equal(spld, dict(nx.single_source_shortest_path_length(G, 3)))
def test_shortest_path_length(self): assert nxt.shortest_path_length([3, 1, 2], 1) == [1, 0, 1, 2, 1, 1] assert nxt.shortest_path_length(["d", "d", "d", "i", "d", "d"], 1) == [ 1, 0, 1, 2, 1, 1, ] assert nxt.shortest_path_length(("d", "d", "d", "i", "d", "d"), 1) == [ 1, 0, 1, 2, 1, 1, ] assert pytest.raises(TypeError, nxt.shortest_path, [3.0, 1.0, 2.0], 1)