def test_add_edge_weight_not_connected(self):
# Mocking a reference graph
graph = networkx.Graph()
node1 = "first_node"
node2 = "second_node"
graph.add_node(node1, type="references", occurence_count=10)
graph.add_node(node2, type="references", occurence_count=15)
add_edge_weight(graph, node1, node2)
self.assertEqual(True, graph.has_edge(node1, node2))
def test_add_two_edge_adds_two_edges(self):
# Mocking a reference graph
graph = networkx.Graph()
node1 = "first_node"
node2 = "second_node"
node3 = "third_node"
graph.add_node(node1, type="references", occurence_count=10)
graph.add_node(node2, type="references", occurence_count=15)
graph.add_node(node3, type="references", occurence_count=20)
add_edge_weight(graph, node1, node2)
add_edge_weight(graph, node2, node3) # Add to the same node again.
self.assertEqual(2, graph.number_of_edges())
def test_add_two_edge_weight_not_connected(self):
# Mocking a reference graph
graph = networkx.Graph()
node1 = "first_node"
node2 = "second_node"
node3 = "third_node"
graph.add_node(node1, type="references", occurence_count=10)
graph.add_node(node2, type="references", occurence_count=15)
graph.add_node(node3, type="references", occurence_count=20)
add_edge_weight(graph, node1, node2)
add_edge_weight(graph, node1, node3) # Add to the same node again.
self.assertEqual(True, graph.has_edge(node1, node2))
self.assertEqual(True, graph.has_edge(node1, node3))
def test_add_edge_weight_connected(self):
# Mocking a reference graph
graph = networkx.Graph()
node1 = "first_node"
node2 = "second_node"
graph.add_node(node1, type="references", occurence_count=10)
graph.add_node(node2, type="references", occurence_count=15)
# Manually creating an edge between these two nodes.
graph.add_edge(node1, node2, weight=1)
for i in range(1, 10):
add_edge_weight(graph, node1, node2)
# Weighting for this edge should now be 10.
self.assertEqual(True, graph[node1][node2]["weight"] == 10)
def test_add_edge_num_edges_connected(self):
# Mocking a reference graph
graph = networkx.Graph()
node1 = "first_node"
node2 = "second_node"
graph.add_node(node1, type="references", occurence_count=10)
graph.add_node(node2, type="references", occurence_count=15)
# Manually creating an edge between these two nodes.
graph.add_edge(node1, node2, weight=1)
for i in range(1, 20):
add_edge_weight(graph, node1, node2)
# Total num of edges should still be 1.
self.assertNotEqual(20, graph.number_of_edges())
self.assertEqual(1, graph.number_of_edges())