def test_has_node(self):
"""
test has_node
"""
dgraph = Digraph()
dgraph.add_node('one')
self.assertTrue(dgraph.has_node('one'))
def test_add_node(self):
"""
test add_node
"""
dgraph = Digraph()
dgraph.add_node('one')
self.assertIn('one', dgraph.nodes)
def test_del_node(self):
"""
test del_node
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
dgraph.del_node('one')
self.assertNotIn('one', dgraph.nodes)
def test_add_edge(self):
"""
test add_edge
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
dgraph.add_edge(('one', 'two'))
self.assertIn('two', dgraph.nodes['one'])
def test_get_node_order(self):
"""
Test get_node_order
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
if n != 'one':
dgraph.add_edge(('one', n))
self.assertEquals(dgraph.get_node_order('one'), 2)
def test_has_edge(self):
"""
test has_edge
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
if n != 'one':
dgraph.add_edge(('one', n))
self.assertTrue(dgraph.has_edge(('one', 'two')))
self.assertTrue(dgraph.has_edge(('one', 'three')))
def test_get_nodes(self):
"""
test get_nodes
We will add a bunch of nodes and make sure it returns all of them. We're
using a set comparison, because
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
self.assertEquals(set(dgraph.get_nodes()), set(node_list))
def test_del_edge(self):
"""
Test del_edge
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
if n != 'one':
dgraph.add_edge(('one', n))
dgraph.del_edge(('one', 'two'))
self.assertNotIn('two', dgraph.nodes['one'])
def test_get_neighbors(self):
"""
test get_neighbors
Add a few nodes to a graph, and then add a few neighbors to that node,
and check whether get_neighbors returns the expected result
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
if n != 'one':
dgraph.add_edge(('one', n))
self.assertEquals(dgraph.get_neighbors('one'), ['two', 'three'])
def test_get_edges(self):
"""
test get_edges
Add a few nodes to a graph, and then add a few edges to the graph. Check
whether get_edges returns the expected edges
"""
dgraph = Digraph()
node_list = ['one', 'two', 'three']
for n in node_list:
dgraph.add_node(n)
if n != 'one':
dgraph.add_edge(('one', n))
edges = [('one', 'two'), ('one', 'three')]
self.assertEquals(dgraph.get_edges(), edges)
