GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-03-04 06:38:47 +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

26
graphs_trees/graph_build_order/build_order_challenge.ipynb
View File

@@ -151,13 +151,13 @@
"outputs": [],
"source": [
"# %load test_build_order.py\n",
"from nose.tools import assert_equal\n",
"from nose.tools import assert_true\n",
"import unittest\n",
"\n",
"\n",
"class TestBuildOrder(object):\n",
"class TestBuildOrder(unittest.TestCase):\n",
"\n",
" def __init__(self):\n",
" def __init__(self, *args, **kwargs):\n",
" super(TestBuildOrder, self).__init__()\n",
" self.dependencies = [\n",
" Dependency('d', 'g'),\n",
" Dependency('f', 'c'),\n",
@@ -175,13 +175,13 @@
"\n",
" expected_result0 = ('d', 'f')\n",
" expected_result1 = ('c', 'b', 'g')\n",
" assert_true(processed_nodes[0].key in expected_result0)\n",
" assert_true(processed_nodes[1].key in expected_result0)\n",
" assert_true(processed_nodes[2].key in expected_result1)\n",
" assert_true(processed_nodes[3].key in expected_result1)\n",
" assert_true(processed_nodes[4].key in expected_result1)\n",
" assert_true(processed_nodes[5].key is 'a')\n",
" assert_true(processed_nodes[6].key is 'e')\n",
" self.assertTrue(processed_nodes[0].key in expected_result0)\n",
" self.assertTrue(processed_nodes[1].key in expected_result0)\n",
" self.assertTrue(processed_nodes[2].key in expected_result1)\n",
" self.assertTrue(processed_nodes[3].key in expected_result1)\n",
" self.assertTrue(processed_nodes[4].key in expected_result1)\n",
" self.assertTrue(processed_nodes[5].key is 'a')\n",
" self.assertTrue(processed_nodes[6].key is 'e')\n",
"\n",
" print('Success: test_build_order')\n",
"\n",
@@ -189,7 +189,7 @@
" self.dependencies.append(Dependency('e', 'f'))\n",
" build_order = BuildOrder(self.dependencies)\n",
" processed_nodes = build_order.find_build_order()\n",
" assert_true(processed_nodes is None)\n",
" self.assertTrue(processed_nodes is None)\n",
"\n",
" print('Success: test_build_order_circular')\n",
"\n",
@@ -230,7 +230,7 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.6.4"
"version": "3.7.2"
}
},
"nbformat": 4,

52
graphs_trees/graph_build_order/build_order_solution.ipynb
View File

@@ -101,9 +101,7 @@
{
"cell_type": "code",
"execution_count": 1,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"from collections import deque\n",
@@ -119,9 +117,7 @@
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"%run ../graph/graph.py"
@@ -130,9 +126,7 @@
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [],
"source": [
"class BuildOrder(object):\n",
@@ -187,9 +181,7 @@
{
"cell_type": "code",
"execution_count": 4,
"metadata": {
"collapsed": true
},
"metadata": {},
"outputs": [],
"source": [
"%run ../utils/results.py"
@@ -198,9 +190,7 @@
{
"cell_type": "code",
"execution_count": 5,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -212,13 +202,13 @@
],
"source": [
"%%writefile test_build_order.py\n",
"from nose.tools import assert_equal\n",
"from nose.tools import assert_true\n",
"import unittest\n",
"\n",
"\n",
"class TestBuildOrder(object):\n",
"class TestBuildOrder(unittest.TestCase):\n",
"\n",
" def __init__(self):\n",
" def __init__(self, *args, **kwargs):\n",
" super(TestBuildOrder, self).__init__()\n",
" self.dependencies = [\n",
" Dependency('d', 'g'),\n",
" Dependency('f', 'c'),\n",
@@ -236,13 +226,13 @@
"\n",
" expected_result0 = ('d', 'f')\n",
" expected_result1 = ('c', 'b', 'g')\n",
" assert_true(processed_nodes[0].key in expected_result0)\n",
" assert_true(processed_nodes[1].key in expected_result0)\n",
" assert_true(processed_nodes[2].key in expected_result1)\n",
" assert_true(processed_nodes[3].key in expected_result1)\n",
" assert_true(processed_nodes[4].key in expected_result1)\n",
" assert_true(processed_nodes[5].key is 'a')\n",
" assert_true(processed_nodes[6].key is 'e')\n",
" self.assertTrue(processed_nodes[0].key in expected_result0)\n",
" self.assertTrue(processed_nodes[1].key in expected_result0)\n",
" self.assertTrue(processed_nodes[2].key in expected_result1)\n",
" self.assertTrue(processed_nodes[3].key in expected_result1)\n",
" self.assertTrue(processed_nodes[4].key in expected_result1)\n",
" self.assertTrue(processed_nodes[5].key is 'a')\n",
" self.assertTrue(processed_nodes[6].key is 'e')\n",
"\n",
" print('Success: test_build_order')\n",
"\n",
@@ -250,7 +240,7 @@
" self.dependencies.append(Dependency('e', 'f'))\n",
" build_order = BuildOrder(self.dependencies)\n",
" processed_nodes = build_order.find_build_order()\n",
" assert_true(processed_nodes is None)\n",
" self.assertTrue(processed_nodes is None)\n",
"\n",
" print('Success: test_build_order_circular')\n",
"\n",
@@ -268,9 +258,7 @@
{
"cell_type": "code",
"execution_count": 6,
"metadata": {
"collapsed": false
},
"metadata": {},
"outputs": [
{
"name": "stdout",
@@ -302,9 +290,9 @@
"name": "python",
"nbconvert_exporter": "python",
"pygments_lexer": "ipython3",
"version": "3.5.0"
"version": "3.7.2"
}
},
"nbformat": 4,
"nbformat_minor": 0
"nbformat_minor": 1
}

26
graphs_trees/graph_build_order/test_build_order.py
View File

@@ -1,10 +1,10 @@
from nose.tools import assert_equal
from nose.tools import assert_true
import unittest
class TestBuildOrder(object):
class TestBuildOrder(unittest.TestCase):
def __init__(self):
def __init__(self, *args, **kwargs):
super(TestBuildOrder, self).__init__()
self.dependencies = [
Dependency('d', 'g'),
Dependency('f', 'c'),
@@ -22,13 +22,13 @@ class TestBuildOrder(object):
expected_result0 = ('d', 'f')
expected_result1 = ('c', 'b', 'g')
assert_true(processed_nodes[0].key in expected_result0)
assert_true(processed_nodes[1].key in expected_result0)
assert_true(processed_nodes[2].key in expected_result1)
assert_true(processed_nodes[3].key in expected_result1)
assert_true(processed_nodes[4].key in expected_result1)
assert_true(processed_nodes[5].key is 'a')
assert_true(processed_nodes[6].key is 'e')
self.assertTrue(processed_nodes[0].key in expected_result0)
self.assertTrue(processed_nodes[1].key in expected_result0)
self.assertTrue(processed_nodes[2].key in expected_result1)
self.assertTrue(processed_nodes[3].key in expected_result1)
self.assertTrue(processed_nodes[4].key in expected_result1)
self.assertTrue(processed_nodes[5].key is 'a')
self.assertTrue(processed_nodes[6].key is 'e')
print('Success: test_build_order')
@@ -36,7 +36,7 @@ class TestBuildOrder(object):
self.dependencies.append(Dependency('e', 'f'))
build_order = BuildOrder(self.dependencies)
processed_nodes = build_order.find_build_order()
assert_true(processed_nodes is None)
self.assertTrue(processed_nodes is None)
print('Success: test_build_order_circular')
@@ -48,4 +48,4 @@ def main():
if __name__ == '__main__':
main()
main()