class TestGraphLadder(unittest.TestCase):
def setUp(self):
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.edges = [
Edge(0, 1, 2),
Edge(0, 2, 1),
Edge(2, 3, 5),
Edge(1, 3, 3),
Edge(2, 4, 4),
Edge(3, 5, 6),
Edge(4, 6, 7),
Edge(4, 5, 8),
Edge(5, 7, 9),
Edge(6, 7, 10)
]
for edge in self.edges:
self.G.add_edge(edge)
def test_basic(self):
self.assertFalse(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), len(self.edges))
def test_edges(self):
for edge in self.edges:
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(self.G.weight(edge), edge.weight)
self.assertFalse(self.G.has_edge(Edge(0, 3)))
self.assertEqual(self.G.weight(Edge(0, 3)), 0) # no edge
def test_del(self):
self.assertEqual(self.G.e(), 10)
self.G.del_node(7)
self.assertEqual(self.G.e(), 8)
self.G.del_node(2)
self.assertEqual(self.G.e(), 5)
def test_adjacent(self):
for node in self.G.iteradjacent(0):
self.assertTrue(node in [1, 2])
for node in self.G.iteradjacent(2):
self.assertTrue(node in [0, 3, 4])
def tearDown(self):
pass
class TestGraphLadder(unittest.TestCase):
def setUp(self):
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.edges = [
Edge(0, 1, 2), Edge(0, 2, 1), Edge(2, 3, 5),
Edge(1, 3, 3), Edge(2, 4, 4), Edge(3, 5, 6), Edge(4, 6, 7),
Edge(4, 5, 8), Edge(5, 7, 9), Edge(6, 7, 10)]
for edge in self.edges:
self.G.add_edge(edge)
def test_basic(self):
self.assertFalse(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), len(self.edges))
def test_edges(self):
for edge in self.edges:
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(self.G.weight(edge), edge.weight)
self.assertFalse(self.G.has_edge(Edge(0, 3)))
self.assertEqual(self.G.weight(Edge(0, 3)), 0) # no edge
def test_del(self):
self.assertEqual(self.G.e(), 10)
self.G.del_node(7)
self.assertEqual(self.G.e(), 8)
self.G.del_node(2)
self.assertEqual(self.G.e(), 5)
def test_adjacent(self):
for node in self.G.iteradjacent(0):
self.assertTrue(node in [1, 2])
for node in self.G.iteradjacent(2):
self.assertTrue(node in [0, 3, 4])
def tearDown(self): pass
class TestDFS(unittest.TestCase):
def setUp(self):
# The graph from Cormen p.607
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.nodes = range(self.N)
self.edges = [
Edge(0, 4, 2), Edge(0, 1, 3), Edge(1, 5, 4), Edge(5, 2, 5),
Edge(5, 6, 6), Edge(2, 6, 7), Edge(2, 3, 8), Edge(6, 3, 9),
Edge(6, 7, 10), Edge(3, 7, 11)]
for node in self.nodes:
self.G.add_node(node)
for edge in self.edges:
self.G.add_edge(edge)
#print self.G
#self.G.show()
def test_dfs_with_stack(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = DFSWithStack(self.G)
algorithm.run(1, pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 5, 2, 6, 3, 7, 4]
post_order_expected = [1, 5, 6, 7, 3, 2, 0, 4]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
dd_expected = {0: 2, 1: 1, 2: 5, 3: 8, 4: 14, 5: 3, 6: 6, 7: 9}
ff_expected = {0: 15, 1: 4, 2: 13, 3: 12, 4: 16, 5: 7, 6: 10, 7: 11}
self.assertEqual(algorithm.dd, dd_expected)
self.assertEqual(algorithm.ff, ff_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 6, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N-1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_dfs_with_recursion(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = DFSWithRecursion(self.G)
algorithm.run(1, pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 4, 5, 2, 3, 6, 7]
post_order_expected = [4, 0, 7, 6, 3, 2, 5, 1]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
dd_expected = {0: 2, 1: 1, 2: 7, 3: 8, 4: 3, 5: 6, 6: 9, 7: 10}
ff_expected = {0: 5, 1: 16, 2: 14, 3: 13, 4: 4, 5: 15, 6: 12, 7: 11}
self.assertEqual(algorithm.dd, dd_expected)
self.assertEqual(algorithm.ff, ff_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 3, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 2, 3, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N-1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_simple_dfs_with_recursion(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = SimpleDFS(self.G)
algorithm.run(1, pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 4, 5, 2, 3, 6, 7]
post_order_expected = [4, 0, 7, 6, 3, 2, 5, 1]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 3, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 2, 3, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N-1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def tearDown(self): pass
class TestDFS(unittest.TestCase):
def setUp(self):
# The graph from Cormen p.607
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.nodes = range(self.N)
self.edges = [
Edge(0, 4, 2),
Edge(0, 1, 3),
Edge(1, 5, 4),
Edge(5, 2, 5),
Edge(5, 6, 6),
Edge(2, 6, 7),
Edge(2, 3, 8),
Edge(6, 3, 9),
Edge(6, 7, 10),
Edge(3, 7, 11)
]
for node in self.nodes:
self.G.add_node(node)
for edge in self.edges:
self.G.add_edge(edge)
#print self.G
#self.G.show()
def test_dfs_with_stack(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = DFSWithStack(self.G)
algorithm.run(1,
pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 5, 2, 6, 3, 7, 4]
post_order_expected = [1, 5, 6, 7, 3, 2, 0, 4]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
dd_expected = {0: 2, 1: 1, 2: 5, 3: 8, 4: 14, 5: 3, 6: 6, 7: 9}
ff_expected = {0: 15, 1: 4, 2: 13, 3: 12, 4: 16, 5: 7, 6: 10, 7: 11}
self.assertEqual(algorithm.dd, dd_expected)
self.assertEqual(algorithm.ff, ff_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 6, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N - 1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_dfs_with_recursion(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = DFSWithRecursion(self.G)
algorithm.run(1,
pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 4, 5, 2, 3, 6, 7]
post_order_expected = [4, 0, 7, 6, 3, 2, 5, 1]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
dd_expected = {0: 2, 1: 1, 2: 7, 3: 8, 4: 3, 5: 6, 6: 9, 7: 10}
ff_expected = {0: 5, 1: 16, 2: 14, 3: 13, 4: 4, 5: 15, 6: 12, 7: 11}
self.assertEqual(algorithm.dd, dd_expected)
self.assertEqual(algorithm.ff, ff_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 3, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 2, 3, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N - 1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_simple_dfs_with_recursion(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = SimpleDFS(self.G)
algorithm.run(1,
pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
pre_order_expected = [1, 0, 4, 5, 2, 3, 6, 7]
post_order_expected = [4, 0, 7, 6, 3, 2, 5, 1]
self.assertEqual(pre_order, pre_order_expected)
self.assertEqual(post_order, post_order_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 3, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 2, 3, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N - 1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def tearDown(self):
pass
class TestBFS(unittest.TestCase):
def setUp(self):
# The graph from Cormen p.607
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.nodes = range(self.N)
self.edges = [
Edge(0, 4, 2),
Edge(0, 1, 3),
Edge(1, 5, 4),
Edge(5, 2, 5),
Edge(5, 6, 6),
Edge(2, 6, 7),
Edge(2, 3, 8),
Edge(6, 3, 9),
Edge(6, 7, 10),
Edge(3, 7, 11)
]
for node in self.nodes:
self.G.add_node(node)
for edge in self.edges:
self.G.add_edge(edge)
#print self.G
#self.G.show()
def test_bfs(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = BFSWithQueue(self.G)
algorithm.run(1,
pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
order_expected = [1, 0, 5, 4, 2, 6, 3, 7]
self.assertEqual(pre_order, order_expected)
self.assertEqual(post_order, order_expected)
distance_expected = {0: 1, 1: 0, 2: 2, 3: 3, 4: 2, 5: 1, 6: 2, 7: 3}
self.assertEqual(algorithm.distance, distance_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
self.assertRaises(ValueError, algorithm.path, 4, 7)
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N - 1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_simple_bfs(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = SimpleBFS(self.G)
algorithm.run(1,
pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
order_expected = [1, 0, 5, 4, 2, 6, 3, 7]
self.assertEqual(pre_order, order_expected)
self.assertEqual(post_order, order_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
self.assertRaises(ValueError, algorithm.path, 4, 7)
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N - 1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def tearDown(self):
pass
class TestBFS(unittest.TestCase):
def setUp(self):
# The graph from Cormen p.607
self.N = 8 # number of nodes
self.G = Graph(self.N)
self.nodes = range(self.N)
self.edges = [
Edge(0, 4, 2), Edge(0, 1, 3), Edge(1, 5, 4), Edge(5, 2, 5),
Edge(5, 6, 6), Edge(2, 6, 7), Edge(2, 3, 8), Edge(6, 3, 9),
Edge(6, 7, 10), Edge(3, 7, 11)]
for node in self.nodes:
self.G.add_node(node)
for edge in self.edges:
self.G.add_edge(edge)
#print self.G
#self.G.show()
def test_bfs(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = BFSWithQueue(self.G)
algorithm.run(1, pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
order_expected = [1, 0, 5, 4, 2, 6, 3, 7]
self.assertEqual(pre_order, order_expected)
self.assertEqual(post_order, order_expected)
distance_expected = {0: 1, 1: 0, 2: 2, 3: 3, 4: 2, 5: 1, 6: 2, 7: 3}
self.assertEqual(algorithm.distance, distance_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
self.assertRaises(ValueError, algorithm.path, 4, 7)
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N-1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def test_simple_bfs(self):
self.assertEqual(self.G.v(), self.N)
pre_order = []
post_order = []
algorithm = SimpleBFS(self.G)
algorithm.run(1, pre_action=lambda node: pre_order.append(node),
post_action=lambda node: post_order.append(node))
order_expected = [1, 0, 5, 4, 2, 6, 3, 7]
self.assertEqual(pre_order, order_expected)
self.assertEqual(post_order, order_expected)
parent_expected = {0: 1, 1: None, 2: 5, 3: 2, 4: 0, 5: 1, 6: 5, 7: 6}
self.assertEqual(algorithm.parent, parent_expected)
self.assertEqual(algorithm.path(1, 7), [1, 5, 6, 7])
self.assertEqual(algorithm.path(1, 4), [1, 0, 4])
self.assertRaises(ValueError, algorithm.path, 4, 7)
#algorithm.dag.show()
self.assertEqual(algorithm.dag.v(), self.N)
self.assertEqual(algorithm.dag.e(), self.N-1)
self.assertTrue(algorithm.dag.is_directed())
for edge in algorithm.dag.iteredges():
self.assertTrue(self.G.has_edge(edge))
self.assertEqual(edge.weight, self.G.weight(edge))
def tearDown(self): pass