def test_disconnected_triads_num_distances():
G = nx.Graph()
# First triad
G.add_edges_from([(1, 2), (2, 3), (3, 1)])
# Second triad
G.add_edges_from([(4, 5), (5, 6), (6, 4)])
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == 3**2 + 3**2
def test_disconnected_triads_sum_distances():
G = nx.Graph()
# First triad
G.add_edges_from([(1, 2), (2, 3), (3, 1)])
# Second triad
G.add_edges_from([(4, 5), (5, 6), (6, 4)])
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == 12
def test_three_components_num_distances_2():
G = nx.Graph()
# First triad
G.add_edges_from([(1, 2), (2, 3), (3, 1)])
# Second triad
G.add_edges_from([(4, 5), (5, 6), (6, 4)])
G.add_edge(9, 10)
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == 3**2 + 3**2 + 2**2
def test_three_components_sum_distances_2():
G = nx.Graph()
# First triad
G.add_edges_from([(1, 2), (2, 3), (3, 1)])
# Second triad
G.add_edges_from([(4, 5), (5, 6), (6, 4)])
G.add_edge(9, 10)
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == 14
def test_zkc_sum_distances():
G = nx.karate_club_graph()
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == sum(
[sum(x.values()) for _, x in nx.all_pairs_shortest_path_length(G)])
def test_single_edge_sum_distances():
G = nx.Graph()
G.add_edge(1, 2)
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == 2
def test_singleton_sum_distances():
G = nx.Graph()
G.add_node(1)
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == 0
def test_empty_sum_distances():
G = nx.Graph()
sum_distances = sum(
[k * v for k, v in ss.all_pairs_shortest_paths(G).items()])
assert sum_distances == 0
def test_zkc_num_distances():
G = nx.karate_club_graph()
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == len(G)**2
def test_single_edge_num_distances():
G = nx.Graph()
G.add_edge(1, 2)
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == len(G)**2
def test_singleton_num_distances():
G = nx.Graph()
G.add_node(1)
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == 1 # convention
def test_empty_num_distances():
G = nx.Graph()
num_distances = sum(ss.all_pairs_shortest_paths(G).values())
assert num_distances == 1 # convention