def test_dijkstra_2(self):
g = DirectedGraph()
for i in range(100):
g.add_vertex(i)
for _ in range(250):
a = random.randint(1, 100)
b = random.randint(1, 100)
if a != b:
g.add_edge(a, b, random.randint(1, 100))
distance, path = dijkstra(g, 1, 100)
if path:
cur_dist = 0
start = 1
for i in path:
for edge in g.adjacency_list[start]:
if edge.b == i:
cur_dist += edge.weight
break
start = i
if cur_dist == 0:
cur_dist = sys.maxsize
assert cur_dist == distance
def setUp(self):
g = DirectedGraph()
g.add_edge(1, 2, 2)
g.add_edge(1, 3, 6)
g.add_edge(2, 3, 3)
g.add_edge(2, 4, 1)
g.add_edge(3, 4, 1)
g.add_edge(3, 5, 4)
g.add_edge(4, 5, 6)
self.graph = g
def setUp(self):
g = DirectedGraph()
g.add_edge(1, 2, 2)
g.add_edge(1, 3, 6)
g.add_edge(2, 3, 3)
g.add_edge(2, 4, 1)
g.add_edge(3, 4, 1)
g.add_edge(3, 5, 4)
g.add_edge(4, 5, 6)
self.graph = g
def test_question_2(self):
directed = DirectedGraph()
directed.add_edge(1, 2, 2)
directed.add_edge(1, 3, 6)
directed.add_edge(2, 3, 3)
directed.add_edge(2, 4, 1)
directed.add_edge(3, 4, 1)
directed.add_edge(3, 5, 4)
directed.add_edge(4, 5, 6)
assert points_are_connected(directed, 1, 5)
assert not points_are_connected(directed, 5, 1)
class TestGraph(unittest.TestCase):
def setUp(self):
self.undirected = UndirectedGraph()
self.undirected.add_edge(1, 2, 2)
self.undirected.add_edge(1, 3, 6)
self.undirected.add_edge(2, 3, 3)
self.undirected.add_edge(2, 4, 1)
self.undirected.add_edge(3, 4, 1)
self.undirected.add_edge(3, 5, 4)
self.undirected.add_edge(4, 5, 6)
self.directed = DirectedGraph()
self.directed.add_edge(1, 2, 2)
self.directed.add_edge(1, 3, 6)
self.directed.add_edge(2, 3, 3)
self.directed.add_edge(2, 4, 1)
self.directed.add_edge(3, 4, 1)
self.directed.add_edge(3, 5, 4)
self.directed.add_edge(4, 5, 6)
def test_get_edges(self):
assert self.undirected.get_all_edges() == self.directed.get_all_edges()
assert self.undirected.get_vertices() == self.directed.get_vertices()
def test_directed_graph(self):
assert len(self.directed.get_successive_vertices(4)) == 1
assert len(self.undirected.get_successive_vertices(4)) == 3
assert self.undirected.edge_exists(4, 3)
assert not self.directed.edge_exists(4, 3)
self.directed.delete_edge(4, 3)
self.undirected.delete_edge(4, 3)
assert len(self.directed.get_all_edges()) == len(self.undirected.get_all_edges()) + 1
def test_undirected_graph(self):
g = UndirectedGraph()
class TestGraph(unittest.TestCase):
def setUp(self):
self.undirected = UndirectedGraph()
self.undirected.add_edge(1, 2, 2)
self.undirected.add_edge(1, 3, 6)
self.undirected.add_edge(2, 3, 3)
self.undirected.add_edge(2, 4, 1)
self.undirected.add_edge(3, 4, 1)
self.undirected.add_edge(3, 5, 4)
self.undirected.add_edge(4, 5, 6)
self.directed = DirectedGraph()
self.directed.add_edge(1, 2, 2)
self.directed.add_edge(1, 3, 6)
self.directed.add_edge(2, 3, 3)
self.directed.add_edge(2, 4, 1)
self.directed.add_edge(3, 4, 1)
self.directed.add_edge(3, 5, 4)
self.directed.add_edge(4, 5, 6)
def test_get_edges(self):
assert self.undirected.get_all_edges() == self.directed.get_all_edges()
assert self.undirected.get_vertices() == self.directed.get_vertices()
def test_directed_graph(self):
assert len(self.directed.get_successive_vertices(4)) == 1
assert len(self.undirected.get_successive_vertices(4)) == 3
assert self.undirected.edge_exists(4, 3)
assert not self.directed.edge_exists(4, 3)
self.directed.delete_edge(4, 3)
self.undirected.delete_edge(4, 3)
assert len(self.directed.get_all_edges()) == len(
self.undirected.get_all_edges()) + 1
def test_undirected_graph(self):
g = UndirectedGraph()
