def test_add_remove(self):
"""
This test contains the basic methods implemented in DiGraph
@:param: mc -> measured by the method "get_mc"
@:param: nodes -> measured by the method "v_size"
@:param: edges -> measured by the method "e_size"
:return: True if it works
"""
print("test add remove")
graph = DiGraph()
graph.add_node(1)
self.assertEqual(graph.v_size(), 1,
"You have added a node to your Graph")
self.assertEqual(graph.get_mc(), 1,
"You have added a node to your Graph")
self.assertEqual(graph.e_size(), 0, "The graph is Edges free")
graph.add_node(2)
self.assertEqual(graph.v_size(), 2,
"You have added a node to your Graph")
graph.add_edge(1, 2, 2.0)
self.assertEqual(graph.get_mc(), 3, "You have a 2 node Graph")
self.assertEqual(graph.e_size(), 1, "The graph has 1 Edge")
graph.remove_node(2)
self.assertFalse(2 in graph.get_all_v())
print("Completed")
def test_v_size(self):
counter = 0
g = DiGraph()
for i in range(10000):
g.add_node(i)
counter += 1
for i in range(500):
g.remove_node(i)
counter -= 1
self.assertEqual(counter, g.v_size())
def test_remove_node(self):
g = DiGraph()
flag = True
g.add_node(11)
for i in range(10):
g.add_node(i)
g.add_edge(i, 11, 1)
for i in range(10):
flag = g.remove_node(i)
if not flag:
break
self.assertEqual(flag, True)
class TestDiGraph(unittest.TestCase):
def setUp(self) -> None:
"""
build the central graph for all the tests
"""
self.graph = DiGraph()
self.graph.add_node(1)
self.graph.add_node(2)
self.graph.add_node(3)
self.graph.add_node(4)
self.graph.add_node(5)
self.graph.add_edge(1, 2, 600)
self.graph.add_edge(2, 3, 600)
self.graph.add_edge(3, 1, 600)
self.graph.add_edge(3, 4, 600)
self.graph.add_edge(4, 5, 600)
self.graph.add_edge(5, 4, 600)
def test_v_size(self):
self.assertEqual(5, self.graph.v_size())
def test_e_size(self):
self.assertEqual(6, self.graph.e_size())
def test_get_mc(self):
self.assertEqual(11, self.graph.get_mc())
def test_removeEdge(self):
self.graph.remove_edge(3, 1)
self.graph.remove_edge(2, 3)
self.graph.remove_edge(5, 4)
self.assertEqual(3, self.graph.e_size())
self.graph.add_edge(3, 1, 1.67)
self.assertEqual(4, self.graph.e_size())
def test_removeNode(self):
self.graph.remove_node(1)
self.graph.remove_node(3)
self.graph.remove_node(1)
self.assertEqual(3, self.graph.v_size())
def test_add_node(self):
self.graph.add_node(6)
self.graph.add_node(7)
self.graph.add_node(8)
self.graph.add_node(8)
self.assertEqual(8, self.graph.v_size())
def test_all_in_edges_of_node(self):
self.assertTrue(len(self.graph.all_in_edges_of_node(1)) == 1)
self.assertTrue(len(self.graph.all_in_edges_of_node(2)) == 1)
self.graph.add_node(6)
self.graph.add_edge(6, 3, 5.5)
self.assertTrue(len(self.graph.all_in_edges_of_node(3)) == 2)
def test_all_out_edges_of_node(self):
self.assertTrue(len(self.graph.all_out_edges_of_node(2)) == 1)
self.assertTrue(len(self.graph.all_out_edges_of_node(4)) == 1)
self.assertTrue(len(self.graph.all_out_edges_of_node(3)) == 2)
