def load_from_json(self, file_name: str):
if self is None:
return False
new_graph = DiGraph()
try:
with open(file_name, 'r') as fp:
jsn = json.load(fp)
for item in jsn['Nodes']:
new_graph.add_node(item.get('id'))
if item.get('pos') is not None:
pos = item.get('pos')
x, y, z = pos.split(',')
x = float(x)
y = float(y)
z = float(z)
new_graph.get_node(item.get('id')).pos = (x, y, z)
for edge in jsn['Edges']:
src = edge['src']
dest = edge['dest']
w = edge['w']
new_graph.add_edge(src, dest, w)
self.g = new_graph
except:
print('cant open file')
return False
return True
def reverse_graph(self, graph):
graph2 = DiGraph()
for node in graph.get_all_v().keys():
graph2.add_node(node)
for ver in graph.get_all_v().values():
for edge in graph.all_out_edges_of_node(ver.id).keys():
graph2.add_edge(edge, ver.id, 0)
return graph2
def test_remove_edge(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
for i in range(4):
g.add_edge(i, i + 1, 5)
self.assertFalse(g.remove_edge(1, 6))
self.assertFalse(g.remove_edge(7, 6))
g.add_edge(0, 2, 2)
g.add_edge(0, 3, 2)
g.add_edge(0, 4, 2)
g.add_edge(0, 5, 2)
g.remove_edge(0, 1)
g.remove_edge(0, 4)
list = [2, 3, 5]
sec_list = []
for key in g.all_out_edges_of_node(0).keys():
sec_list.append(key)
self.assertListEqual(sec_list, list)
def test_reverse_graph(self):
g = DiGraph()
graph = DiGraph()
for i in range(5):
g.add_node(i)
graph.add_node(i)
g.add_edge(1, 2, 3)
graph.add_edge(2, 1, 3)
g.add_edge(0, 4, 3)
graph.add_edge(4, 0, 3)
g.add_edge(1, 3, 3)
graph.add_edge(3, 1, 3)
g.add_edge(3, 2, 3)
graph.add_edge(2, 3, 3)
algo = GraphAlgo(g)
self.assertNotEqual(algo.g, graph)
algo.g = algo.reverse_graph(algo.get_graph())
self.assertEqual(graph, algo.get_graph())
def test_connected_component(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(0, 1, 5)
g.add_edge(0, 2, 3)
g.add_edge(0, 1, 5)
g.add_edge(1, 6, 12.1)
g.add_edge(2, 3, 2)
g.add_edge(2, 5, 8)
g.add_edge(3, 4, 1)
g.add_edge(4, 5, 4)
g.add_edge(5, 6, 7)
g.add_edge(3, 0, 1)
g.add_edge(1, 3, 5)
graph = GraphAlgo(g)
self.assertListEqual(graph.connected_component(0), [0, 1, 2, 3])
g.remove_edge(1, 3)
self.assertListEqual(graph.connected_component(0), [0, 2, 3])
g.add_edge(5, 0, 8)
self.assertListEqual(graph.connected_component(0), [0, 2, 3, 4, 5])
def test_shortest_path(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(0, 1, 5)
g.add_edge(0, 2, 3)
g.add_edge(0, 1, 5)
g.add_edge(1, 6, 12.1)
g.add_edge(2, 3, 2)
g.add_edge(2, 5, 8)
g.add_edge(3, 4, 1)
g.add_edge(4, 5, 4)
g.add_edge(5, 6, 7)
graph = GraphAlgo(g)
self.assertTupleEqual(graph.shortest_path(0, 6),
(17, [0, 2, 3, 4, 5, 6]))
graph.g.add_edge(1, 6, 11.9)
self.assertTupleEqual(graph.shortest_path(0, 6),
(17, [0, 2, 3, 4, 5, 6]))
self.assertTupleEqual(graph.shortest_path(6, 0), (float('inf'), []))
self.assertTupleEqual(graph.shortest_path(0, 9), (float('inf'), []))
self.assertTupleEqual(graph.shortest_path(0, 0), (0, [0]))
def test_connected_components(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(0, 1, 5)
g.add_edge(0, 2, 3)
g.add_edge(0, 1, 5)
g.add_edge(1, 6, 12.1)
g.add_edge(2, 3, 2)
g.add_edge(2, 5, 8)
g.add_edge(3, 4, 1)
g.add_edge(4, 5, 4)
g.add_edge(5, 6, 7)
g.add_edge(6, 5, 4)
g.add_edge(3, 0, 1)
g.add_edge(1, 3, 5)
graph = GraphAlgo(g)
self.assertEqual(graph.connected_components(),
[[0, 1, 2, 3], [4], [5, 6]])
graph.g.remove_edge(1, 3)
self.assertEqual(graph.connected_components(),
[[0, 2, 3], [1], [4], [5, 6]])
graph.get_graph().remove_node(0)
self.assertEqual(graph.connected_components(),
[[1], [2], [3], [4], [5, 6]])
def test_all_out_edges_of_node(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 1, 3)
g.add_edge(1, 2, 4)
g.add_edge(1, 6, -8)
g.add_edge(1, 2, 7)
g.add_edge(1, 3, 7)
g.add_edge(1, 4, 4)
g.add_edge(1, 18, 4)
g.remove_node(3)
g.add_edge(1, 6, 3)
g.remove_edge(1, 6)
g.add_edge(1, 5, 3)
self.assertIsNone(g.all_out_edges_of_node(22), None)
dict = g.all_out_edges_of_node(1)
list = []
for key in dict.keys():
list.append(key)
sec_list = [2, 4, 5]
self.assertListEqual(list, sec_list)
def test_all_in_edges_of_node(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 1, 3)
g.add_edge(1, 2, 4)
g.add_edge(1, 6, -8)
g.add_edge(2, 1, 7)
g.add_edge(2, 1, 7)
g.add_edge(4, 1, 4)
g.add_edge(32, 1, 4)
g.add_edge(5, 1, 4)
g.add_edge(5, 1, 3)
g.add_edge(3, 1, 3)
g.remove_node(3)
g.add_edge(6, 1, 3)
g.remove_edge(6, 1)
self.assertIsNone(g.all_in_edges_of_node(22), None)
dict = g.all_in_edges_of_node(1)
self.assertEqual(len(dict), 3)
def test_e_size(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 1, 3)
g.add_edge(1, 2, 4)
g.add_edge(1, 6, -8)
g.add_edge(2, 1, 7)
g.add_edge(2, 1, 7)
g.add_edge(5, 2, 4)
g.add_edge(32, 45, 4)
g.add_edge(1, 9, 4)
g.add_edge(1, 2, 3)
self.assertEqual(g.e_size(), 3)
def test_get_edge(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 1, 3)
g.add_edge(1, 2, 4)
g.add_edge(1, 6, -8)
g.add_edge(2, 1, 7)
g.add_edge(2, 1, 9)
g.add_edge(4, 1, 4)
g.add_edge(32, 1, 4)
g.add_edge(5, 1, 4)
g.add_edge(5, 1, 3)
g.add_edge(3, 1, 3)
g.remove_node(3)
g.add_edge(6, 1, 3)
g.remove_edge(6, 1)
self.assertIsNone(g.get_edge(6, 1))
self.assertIsNone(g.get_edge(6, 6))
self.assertIsNone(g.get_edge(4, 5))
self.assertIsNone(g.get_edge(3, 9))
self.assertEqual(g.get_edge(1, 2), 4)
self.assertEqual(g.get_edge(2, 1), 7)
def test_add_edge(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 2, 3)
g.add_edge(1, 2, 3)
g.add_edge(1, 2, 4)
self.assertFalse(g.add_edge(1, 87, 3))
g.add_edge(92, 2, 3)
self.assertFalse(g.add_edge(1, 5, -3))
self.assertFalse(g.add_edge(1, 1, 3))
g.add_edge(4, 5, 3)
self.assertEqual(g.e_size(), 2)
def test_get_mc(self):
g = DiGraph()
for i in range(7):
g.add_node(i)
g.add_edge(1, 1, 3)
g.add_edge(1, 2, 4)
g.add_edge(1, 6, -8)
g.add_edge(2, 1, 7)
g.add_edge(2, 1, 7)
g.add_edge(4, 1, 4)
g.add_edge(32, 1, 4)
g.add_edge(5, 1, 4)
g.add_edge(5, 1, 3)
g.add_edge(3, 1, 3)
g.remove_node(3)
g.add_edge(6, 1, 3)
g.remove_edge(6, 1)
self.assertEqual(g.get_mc(), 15)