def test_snapshotgraph_size():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.size([0]) == [2]
assert G.size() == [2, 2]
def test_snapshotgraph_save_to_text_delimiter():
input_path = os.path.join(
current_dir,
'inputoutput_text/snapshotgraph_save_to_text_delimiter.txt')
output_path = os.path.join(
current_dir,
'inputoutput_text/snapshotgraph_save_to_text_delimiter_test.txt')
G = dnx.SnapshotGraph()
G.insert(from_numpy_array(
np.array([[0, 1, 1, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0],
[1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 0, 0, 1, 0]])),
start=0,
end=3)
G.insert(from_numpy_array(
np.array([[0, 1, 1, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0],
[1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 0, 0, 1, 0]])),
start=3,
end=10)
G.save_to_txt(output_path, delimiter='|')
with open(input_path, 'r') as input_file:
desired = input_file.read()
with open(output_path, 'r') as output_file:
actual = output_file.read()
assert actual == desired
def test_snapshotgraph__get():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG2 = nx.Graph()
nxG1.add_edges_from([(1, 2), (1, 3)])
nxG2.add_edges_from([(1, 4), (1, 3)])
G.add_snapshot(graph=nxG1, start=0, end=3)
G.add_snapshot(graph=nxG2, start=3, end=10)
# query by index
assert [snapshot for snapshot in G._get(sbunch=[0])] == [nxG1]
assert [snapshot for snapshot in G._get(sbunch=[1])] == [nxG2]
assert [snapshot for snapshot in G._get()] == [nxG1, nxG2]
# query by interval
assert [snapshot for snapshot in G._get(start=1, end=3)] == [nxG1]
assert [snapshot for snapshot in G._get(start=2, end=6)] == [nxG1, nxG2]
assert [snapshot for snapshot in G._get()] == [nxG1, nxG2]
# include interval
assert [
snapshot for snapshot in G._get(start=1, end=5, include_interval=True)
] == [((0, 3), nxG1), ((3, 10), nxG2)]
# split overlaps
assert [
snapshot for snapshot in G._get(start=1, end=3, split_overlaps=True)
][0].nodes() == nxG1.nodes()
def test_snapshotgraph_to_directed():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert isinstance(G.to_directed([0])[0], nx.classes.digraph.DiGraph)
assert isinstance(G.to_directed()[1], nx.classes.digraph.DiGraph)
def test_snapshotgraph_order():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.order([1]) == [3]
assert G.order() == [3, 3]
def test_snapshotgraph_number_of_nodes():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.number_of_nodes(sbunch=[1]) == [3]
assert G.number_of_nodes(sbunch=[0, 1]) == [3, 3]
def test_snapshotgraph_subgraph():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (2, 3), (4, 6), (2, 4)], start=0, end=3)
G.add_snapshot([(1, 2), (2, 3), (4, 6), (2, 4)], start=3, end=10)
H = G.subgraph([4, 6])
assert list(H.get([0])[0].edges(data=True)) == [(4, 6, {})]
def test_snapshotgraph_load_from_text_multi():
path = os.path.join(
current_dir, 'inputoutput_text/snapshotgraph_load_from_text_multi.txt')
desired = dnx.SnapshotGraph()
desired.insert(from_numpy_array(
np.array([[0, 1, 1, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0],
[1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 0, 0, 1, 0]])),
start=0,
end=3)
desired.insert(from_numpy_matrix(
np.array([[0, 1, 1, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0],
[1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 0, 0, 1, 0]])),
start=3,
end=10)
actual = dnx.SnapshotGraph.load_from_txt(path)
for i in range(max(len(actual.get()), len(desired.get()))):
assert list(desired.get()[i].edges(data=True)) == list(
desired.get()[i].edges(data=True))
assert list(desired.snapshots.keys()) == list(actual.snapshots.keys())
def test_snapshotgraph_add_edges_from():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
G.add_edges_from([(5, 6), (7, 6)], [0])
G.add_edges_from([(8, 9), (10, 11)], [0, 1])
assert {(5, 6), (6, 7)}.issubset(set(G.get([0])[0].edges()))
assert {(8, 9), (10, 11)}.issubset(set(G.get([1])[0].edges()))
def test_snapshotgraph_to_undirected():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.is_directed() == [False, False]
assert isinstance(G.to_undirected([0])[0], nx.classes.graph.Graph)
assert isinstance(G.to_undirected()[1], nx.classes.graph.Graph)
def test_snapshotgraph_degree():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert list(G.degree([1])[0]) == [(1, 2), (4, 1), (3, 1)]
assert [
list(G.degree(nbunch=[1, 2])[0]),
list(G.degree(nbunch=[1, 2])[1])
] == [[(1, 2), (2, 1)], [(1, 2)]]
def test_snapshotgraph_add_nodes_from():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
G.add_nodes_from([5, 6, 7], [0])
G.add_nodes_from([8, 9, 10, 11], [1])
assert {5, 6, 7}.issubset(set(G.get([0])[0].nodes()))
assert {8, 9, 10, 11}.issubset(set(G.get([1])[0].nodes()))
def test_snapshotgraph_len():
nxG1 = nx.Graph()
nxG2 = nx.Graph()
nxG1.add_edges_from([(1, 2), (1, 3)])
nxG2.add_edges_from([(1, 4), (1, 3)])
G = dnx.SnapshotGraph()
G.add_snapshot(graph=nxG1, start=0, end=3)
G.add_snapshot(graph=nxG2, start=3, end=10)
assert len(G) == 2
def test_snapshotgraph_get():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG2 = nx.Graph()
nxG1.add_edges_from([(1, 2), (1, 3)])
nxG2.add_edges_from([(1, 4), (1, 3)])
G.add_snapshot(graph=nxG1, start=0, end=3)
G.add_snapshot(graph=nxG2, start=3, end=10)
assert G.get([0]) == [nxG1]
assert G.get(start=2, end=6) == [nxG1, nxG2]
assert G.get() == [nxG1, nxG2]
def test_snapshotgraph_add_snapshot_with_impulses():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG1.add_edges_from([(1, 4), (2, 3)])
G.add_snapshot([(1, 2), (1, 3)], time=1)
G.add_snapshot(graph=nxG1, time=3)
keys = G.snapshots.keys()
assert list(G.snapshots[keys[0]].edges(data=True)) == [(1, 2, {}),
(1, 3, {})]
assert list(G.snapshots[keys[1]].edges(data=True)) == list(
nxG1.edges(data=True))
def test_snapshotgraph_add_snapshot_with_interval():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG1.add_edges_from([(1, 4), (2, 3)])
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot(graph=nxG1, start=3, end=10)
keys = G.snapshots.keys()
assert list(G.snapshots[keys[0]].edges(data=True)) == [(1, 2, {}),
(1, 3, {})]
assert list(G.snapshots[keys[1]].edges(data=True)) == list(
nxG1.edges(data=True))
def test_snapshotgraph_insert_with_interval():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG1.add_edges_from([(1, 2), (1, 3)])
nxG2 = nx.Graph()
nxG2.add_edges_from([(1, 2), (1, 3)])
G.insert(nxG1, start=0, end=3)
assert list(G.snapshots.values()) == [nxG1]
G.insert(nxG1, start=3, end=10)
G.insert(nxG1, start=15, end=17)
G.insert(nxG2, start=10, end=15)
assert list(G.snapshots.values()) == [nxG1, nxG1, nxG2, nxG1]
assert list(G.snapshots.keys()) == [(0, 3), (3, 10), (10, 15), (15, 17)]
def test_snapshotgraph_insert_with_impulses():
G = dnx.SnapshotGraph()
nxG1 = nx.Graph()
nxG1.add_edges_from([(1, 2), (1, 3)])
nxG2 = nx.Graph()
nxG2.add_edges_from([(1, 2), (1, 3)])
G.insert(nxG1, time=1)
assert list(G.snapshots.values()) == [nxG1]
G.insert(nxG1, time=2)
G.insert(nxG1, time=6)
G.insert(nxG2, time=3)
assert list(G.snapshots.values()) == [nxG1, nxG1, nxG2, nxG1]
assert list(G.snapshots.keys()) == [(1, 1), (2, 2), (3, 3), (6, 6)]
def test_snapshotgraph_compute_network_statistic():
g1 = nx.Graph()
g2 = nx.Graph()
g3 = nx.Graph()
sg = dnx.SnapshotGraph()
g1.add_edges_from([(1, 2), (3, 4)])
g2.add_edges_from([(1, 2), (3, 4), (5, 6)])
g3.add_edges_from([(1, 2), (2, 3), (3, 4)])
sg.insert(g1, start=0, end=3)
sg.insert(g2, start=3, end=10)
sg.insert(g3, start=10, end=15)
assert sg.compute_network_statistic(
nx.algorithms.centrality.degree_centrality) == [
nx.algorithms.centrality.degree_centrality(g1),
nx.algorithms.centrality.degree_centrality(g2),
nx.algorithms.centrality.degree_centrality(g3)
]
def test_intervalgraph_from_snapshots_period():
desired = dnx.IntervalGraph()
desired.add_edge(1, 2, 0, 2)
desired.add_edge(6, 7, 0, 2)
desired.add_edge(5, 6, 0, 2)
desired.add_edge(1, 4, 2, 4)
desired.add_edge(1, 3, 0, 4)
desired.add_edge(10, 11, 0, 4)
desired.add_edge(8, 9, 0, 4, weight=1)
sg = dnx.SnapshotGraph()
sg.add_snapshot([(1, 2), (1, 3)], time=0)
sg.add_snapshot([(1, 4), (1, 3)], time=1)
sg.add_edges_from([(5, 6), (7, 6)], [0])
sg.add_edges_from([(8, 9), (10, 11)], [0, 1])
sg.add_edges_from([(8, 9)], weight=1)
actual = dnx.IntervalGraph.from_snapshot_graph(sg, period=2)
assert len(actual.edges()) == len(desired.edges())
for edge in actual.edges(data=True):
assert edge in desired.edges(data=True)
def test_snapshotgraph_has_node():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.has_node(1, [1]) == [True]
assert G.has_node(1) == [True, True]
def test_snapshotgraph_is_directed():
G = dnx.SnapshotGraph()
G.add_snapshot([(1, 2), (1, 3)], start=0, end=3)
G.add_snapshot([(1, 4), (1, 3)], start=3, end=10)
assert G.is_directed([0, 1]) == [False, False]
assert G.is_directed() == [False, False]
def test_snapshotgraph_str():
G = dnx.SnapshotGraph(name='test_name')
assert str(G) == 'test_name'
def test_snapshotgraph_init_default():
G = dnx.SnapshotGraph()
assert G.graph == {}
assert G.name == ''
def test_snapshotgraph_init_attr():
G = dnx.SnapshotGraph(unique_test=123)
assert G.graph['unique_test'] == 123
def test_snapshotgraph_init_name():
G = dnx.SnapshotGraph(name='test_name')
assert G.graph['name'] == 'test_name'
assert G.name == 'test_name'
