def test_add_graph_directed(self):
T = Graph(self.N, directed=True)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
def test_add_graph_directed(self):
T = Graph(self.N, directed=True)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
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 TestGraphUndirected(unittest.TestCase):
def setUp(self):
self.N = 4 # number of nodes
self.G = Graph(self.N)
self.edges = [
Edge(0, 1, 2),
Edge(1, 2, 4),
Edge(2, 0, 6),
Edge(2, 3, 3),
Edge(3, 1, 5)
]
for edge in self.edges:
self.G.add_edge(edge)
#self.G.show()
def test_undirected(self):
self.assertFalse(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 5)
self.G.del_node(1) # node become isolated
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 2)
def test_iteredges(self):
inedges = list(self.G.iterinedges(1))
outedges = list(self.G.iteroutedges(1))
#print inedges, outedges
self.assertEqual(len(inedges), 3)
self.assertEqual(len(outedges), 3)
def test_copy(self):
T = self.G.copy()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(edge))
def test_transpose(self):
T = self.G.transpose()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(~edge))
def test_complement(self):
T = self.G.complement()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.N * (self.N - 1) // 2 - self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertFalse(self.G.has_edge(edge))
for edge in self.G.iteredges():
self.assertFalse(T.has_edge(edge))
def test_degree(self):
self.assertEqual(self.G.degree(0), 2)
self.assertEqual(self.G.degree(1), 3)
self.assertEqual(self.G.degree(2), 3)
self.assertEqual(self.G.degree(3), 2)
def test_add_graph_undirected(self):
T = Graph(self.N)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
def test_load_save(self):
name1 = "undirected_matrixgraph.txt"
name2 = "undirected_matrixgraph.lgl"
name3 = "undirected_matrixgraph.ncol"
self.G.save(name1)
self.G.save_lgl(name2)
self.G.save_ncol(name3)
T = Graph.load(name1)
self.assertEqual(self.G, T)
def tearDown(self):
pass
class TestGraphDirected(unittest.TestCase):
def setUp(self):
self.N = 4 # number of nodes
self.G = Graph(self.N, directed=True)
self.edges = [
Edge(0, 1, 2),
Edge(1, 2, 4),
Edge(2, 0, 6),
Edge(2, 3, 3),
Edge(3, 1, 5)
]
for edge in self.edges:
self.G.add_edge(edge)
#self.G.show()
def test_directed(self):
self.assertTrue(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 5)
self.G.del_node(1)
self.assertEqual(self.G.v(), self.N) # no changes
self.assertEqual(self.G.e(), 2)
def test_cmp(self):
T = Graph(self.N)
self.assertFalse(T == self.G, "directed and undirected graphs")
T = Graph(self.N, directed=True)
for node in [0, 1, 2, 3]:
T.add_node(node)
self.assertFalse(T == self.G, "nodes are different")
T.del_node(3)
self.assertFalse(T == self.G, "numbers of nodes are different")
T.add_node(3)
T.add_edge(Edge(0, 1, 2))
T.add_edge(Edge(1, 2, 4))
T.add_edge(Edge(2, 0, 6))
T.add_edge(Edge(2, 3, 3))
self.assertFalse(T == self.G, "edge numbers are different")
T.add_edge(Edge(3, 1, 7))
self.assertFalse(T == self.G, "edge weights are different")
T.del_edge(Edge(3, 1, 7))
T.add_edge(Edge(1, 3, 5))
self.assertFalse(T == self.G, "edge directions are different")
T.del_edge(Edge(1, 3, 5))
T.add_edge(Edge(3, 1, 5))
self.assertTrue(T == self.G, "graphs are the same")
def test_iteredges(self):
inedges_B = list(self.G.iterinedges(1))
outedges_B = list(self.G.iteroutedges(1))
#print inedges_B, outedges_B
self.assertEqual(len(inedges_B), 2)
self.assertEqual(len(outedges_B), 1)
def test_copy(self):
T = self.G.copy()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(edge))
def test_transpose(self):
T = self.G.transpose()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(~edge))
def test_complement(self):
T = self.G.complement()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.N * (self.N - 1) - self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertFalse(self.G.has_edge(edge))
for edge in self.G.iteredges():
self.assertFalse(T.has_edge(edge))
def test_add_graph_directed(self):
T = Graph(self.N, directed=True)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
def test_degree(self):
self.assertEqual(self.G.indegree(0), 1)
self.assertEqual(self.G.indegree(1), 2)
self.assertEqual(self.G.indegree(2), 1)
self.assertEqual(self.G.indegree(3), 1)
self.assertEqual(self.G.outdegree(0), 1)
self.assertEqual(self.G.outdegree(1), 1)
self.assertEqual(self.G.outdegree(2), 2)
self.assertEqual(self.G.outdegree(3), 1)
def test_exceptions(self):
self.assertRaises(ValueError, self.G.add_edge, Edge(0, 0, 1))
self.assertRaises(ValueError, self.G.add_edge, Edge(0, 1, 2))
self.assertRaises(ValueError, self.G.degree, 0)
def tearDown(self):
pass
class TestGraphUndirected(unittest.TestCase):
def setUp(self):
self.N = 4 # number of nodes
self.G = Graph(self.N)
self.edges = [
Edge(0, 1, 2), Edge(1, 2, 4), Edge(2, 0, 6), Edge(2, 3, 3),
Edge(3, 1, 5)]
for edge in self.edges:
self.G.add_edge(edge)
def test_undirected(self):
self.assertFalse(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 5)
self.G.del_node(1) # node become isolated
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 2)
def test_iteredges(self):
inedges = list(self.G.iterinedges(1))
outedges = list(self.G.iteroutedges(1))
#print inedges, outedges
self.assertEqual(len(inedges), 3)
self.assertEqual(len(outedges), 3)
def test_copy(self):
T = self.G.copy()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(edge))
def test_transpose(self):
T = self.G.transpose()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(~edge))
def test_complement(self):
T = self.G.complement()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.N*(self.N-1)/2 - self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertFalse(self.G.has_edge(edge))
for edge in self.G.iteredges():
self.assertFalse(T.has_edge(edge))
def test_degree(self):
self.assertEqual(self.G.degree(0), 2)
self.assertEqual(self.G.degree(1), 3)
self.assertEqual(self.G.degree(2), 3)
self.assertEqual(self.G.degree(3), 2)
def test_add_graph_undirected(self):
T = Graph(self.N)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
def test_load_save(self):
name1 = "undirected_matrixgraph.txt"
name2 = "undirected_matrixgraph.lgl"
name3 = "undirected_matrixgraph.ncol"
self.G.save(name1)
self.G.save_lgl(name2)
self.G.save_ncol(name3)
T = Graph.load(name1)
self.assertEqual(self.G, T)
def tearDown(self): pass
class TestGraphDirected(unittest.TestCase):
def setUp(self):
self.N = 4 # number of nodes
self.G = Graph(self.N, directed=True)
self.edges = [
Edge(0, 1, 2), Edge(1, 2, 4), Edge(2, 0, 6), Edge(2, 3, 3),
Edge(3, 1, 5)]
for edge in self.edges:
self.G.add_edge(edge)
def test_directed(self):
self.assertTrue(self.G.is_directed())
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 5)
self.G.del_node(1)
self.assertEqual(self.G.v(), self.N) # no changes
self.assertEqual(self.G.e(), 2)
def test_cmp(self):
T = Graph(self.N)
self.assertFalse(T == self.G, "directed and undirected graphs")
T = Graph(self.N, directed=True)
for node in [0, 1, 2, 3]:
T.add_node(node)
self.assertFalse(T == self.G, "nodes are different")
T.del_node(3)
self.assertFalse(T == self.G, "numbers of nodes are different")
T.add_node(3)
T.add_edge(Edge(0, 1, 2))
T.add_edge(Edge(1, 2, 4))
T.add_edge(Edge(2, 0, 6))
T.add_edge(Edge(2, 3, 3))
self.assertFalse(T == self.G, "edge numbers are different")
T.add_edge(Edge(3, 1, 7))
self.assertFalse(T == self.G, "edge weights are different")
T.del_edge(Edge(3, 1, 7))
T.add_edge(Edge(1, 3, 5))
self.assertFalse(T == self.G, "edge directions are different")
T.del_edge(Edge(1, 3, 5))
T.add_edge(Edge(3, 1, 5))
self.assertTrue(T == self.G, "graphs are the same")
def test_iteredges(self):
inedges_B = list(self.G.iterinedges(1))
outedges_B = list(self.G.iteroutedges(1))
#print inedges_B, outedges_B
self.assertEqual(len(inedges_B), 2)
self.assertEqual(len(outedges_B), 1)
def test_copy(self):
T = self.G.copy()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(edge))
def test_transpose(self):
T = self.G.transpose()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertTrue(self.G.has_edge(~edge))
def test_complement(self):
T = self.G.complement()
self.assertEqual(T.v(), self.G.v())
self.assertEqual(T.e(), self.N*(self.N-1) - self.G.e())
for node in T.iternodes():
self.assertTrue(self.G.has_node(node))
for edge in T.iteredges():
self.assertFalse(self.G.has_edge(edge))
for edge in self.G.iteredges():
self.assertFalse(T.has_edge(edge))
def test_add_graph_directed(self):
T = Graph(self.N, directed=True)
T.add_edge(Edge(0, 3, 9))
self.assertEqual(T.v(), self.N)
self.assertEqual(T.e(), 1)
self.G.add_graph(T)
self.assertEqual(self.G.v(), self.N)
self.assertEqual(self.G.e(), 6)
def test_degree(self):
self.assertEqual(self.G.indegree(0), 1)
self.assertEqual(self.G.indegree(1), 2)
self.assertEqual(self.G.indegree(2), 1)
self.assertEqual(self.G.indegree(3), 1)
self.assertEqual(self.G.outdegree(0), 1)
self.assertEqual(self.G.outdegree(1), 1)
self.assertEqual(self.G.outdegree(2), 2)
self.assertEqual(self.G.outdegree(3), 1)
def test_exceptions(self):
self.assertRaises(ValueError, self.G.add_edge, Edge(0, 0, 1))
self.assertRaises(ValueError, self.G.add_edge, Edge(0, 1, 2))
self.assertRaises(ValueError, self.G.degree, 0)
def tearDown(self): pass