GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-12 04:18:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

#273: Remove nose dependency for graphs_trees/ (#277)

Browse Source
This commit is contained in:
Donne Martin
2020-07-10 21:02:32 -04:00
committed by GitHub
parent 139e157250
commit abf7524c26
67 changed files with 860 additions and 1027 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
graphs_trees/graph/test_graph.py
View File

@@ -1,7 +1,7 @@
from nose.tools import assert_equal
import unittest
class TestGraph(object):
class TestGraph(unittest.TestCase):
def create_graph(self):
graph = Graph()
@@ -21,29 +21,29 @@ class TestGraph(object):
graph.add_edge(5, 4, weight=8)
graph.add_edge(5, 2, weight=9)
assert_equal(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
assert_equal(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
assert_equal(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
assert_equal(graph.nodes[2].adj_weights[graph.nodes[3].key], 4)
assert_equal(graph.nodes[3].adj_weights[graph.nodes[4].key], 5)
assert_equal(graph.nodes[3].adj_weights[graph.nodes[5].key], 6)
assert_equal(graph.nodes[4].adj_weights[graph.nodes[0].key], 7)
assert_equal(graph.nodes[5].adj_weights[graph.nodes[4].key], 8)
assert_equal(graph.nodes[5].adj_weights[graph.nodes[2].key], 9)
self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
self.assertEqual(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
self.assertEqual(graph.nodes[2].adj_weights[graph.nodes[3].key], 4)
self.assertEqual(graph.nodes[3].adj_weights[graph.nodes[4].key], 5)
self.assertEqual(graph.nodes[3].adj_weights[graph.nodes[5].key], 6)
self.assertEqual(graph.nodes[4].adj_weights[graph.nodes[0].key], 7)
self.assertEqual(graph.nodes[5].adj_weights[graph.nodes[4].key], 8)
self.assertEqual(graph.nodes[5].adj_weights[graph.nodes[2].key], 9)
assert_equal(graph.nodes[0].incoming_edges, 1)
assert_equal(graph.nodes[1].incoming_edges, 1)
assert_equal(graph.nodes[2].incoming_edges, 2)
assert_equal(graph.nodes[3].incoming_edges, 1)
assert_equal(graph.nodes[4].incoming_edges, 2)
assert_equal(graph.nodes[5].incoming_edges, 2)
self.assertEqual(graph.nodes[0].incoming_edges, 1)
self.assertEqual(graph.nodes[1].incoming_edges, 1)
self.assertEqual(graph.nodes[2].incoming_edges, 2)
self.assertEqual(graph.nodes[3].incoming_edges, 1)
self.assertEqual(graph.nodes[4].incoming_edges, 2)
self.assertEqual(graph.nodes[5].incoming_edges, 2)
graph.nodes[0].remove_neighbor(graph.nodes[1])
assert_equal(graph.nodes[1].incoming_edges, 0)
self.assertEqual(graph.nodes[1].incoming_edges, 0)
graph.nodes[3].remove_neighbor(graph.nodes[4])
assert_equal(graph.nodes[4].incoming_edges, 1)
self.assertEqual(graph.nodes[4].incoming_edges, 1)
assert_equal(graph.nodes[0] < graph.nodes[1], True)
self.assertEqual(graph.nodes[0] < graph.nodes[1], True)
print('Success: test_graph')
@@ -53,12 +53,12 @@ class TestGraph(object):
graph.add_undirected_edge(0, 5, weight=2)
graph.add_undirected_edge(1, 2, weight=3)
assert_equal(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
assert_equal(graph.nodes[1].adj_weights[graph.nodes[0].key], 5)
assert_equal(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
assert_equal(graph.nodes[5].adj_weights[graph.nodes[0].key], 2)
assert_equal(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
assert_equal(graph.nodes[2].adj_weights[graph.nodes[1].key], 3)
self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[1].key], 5)
self.assertEqual(graph.nodes[1].adj_weights[graph.nodes[0].key], 5)
self.assertEqual(graph.nodes[0].adj_weights[graph.nodes[5].key], 2)
self.assertEqual(graph.nodes[5].adj_weights[graph.nodes[0].key], 2)
self.assertEqual(graph.nodes[1].adj_weights[graph.nodes[2].key], 3)
self.assertEqual(graph.nodes[2].adj_weights[graph.nodes[1].key], 3)
print('Success: test_graph_undirected')
@@ -70,4 +70,4 @@ def main():
if __name__ == '__main__':
main()
main()