1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
import sys, unittest
from enthought.testing.api import doctest_for_module
import enthought.util.graph as G
class GraphDocTestCase(doctest_for_module(G)):
pass
class MapTestCase(unittest.TestCase):
def test_map(self):
self.assertEqual(G.map(str, {}), {})
self.assertEqual(G.map(str, {1:[2,3]}), {'1':['2','3']})
self.assertEqual(G.map(lambda x: x, {1:[2,3]}), {1:[2,3]})
class ReachableGraphTestCase(unittest.TestCase):
def _base(self, graph, nodes, result, error=None):
if error:
self.assertRaises(error, lambda: self._base(graph, nodes, result))
else:
self.assertEqual(G.reachable_graph(graph, nodes), result)
def test_reachable_graph(self):
'reachable_graph'
self._base({}, [], {})
self._base({}, [1], {}, error=KeyError)
self._base({1:[2,3], 0:[3]}, [1], {1:[2,3]})
self._base({1:[2,3], 1:[3]}, [1], {1:[2,3], 1:[3]})
self._base({1:[2,3], 2:[3]}, [1], {1:[2,3], 2:[3]})
self._base({1:[2,3], 2:[3]}, [2], {2:[3]})
self._base({1:[2,3], 2:[3]}, [3], {})
self._base({1:[2], 3:[4]}, [1,3], {1:[2], 3:[4]})
class ReverseGraphTestCase(unittest.TestCase):
def _base(self, graph, result, error=None):
if error:
self.assertRaises(error, lambda: self._base(graph, result))
else:
self.assertEqual(G.reverse(graph), result)
def test_reverse(self):
'reverse'
self._base({}, {})
self._base({1:[]}, {1:[]})
self._base({1:[2]}, {2:[1], 1:[]})
self._base({1:[2,3]}, {2:[1], 3:[1], 1:[]})
if __name__ == '__main__':
unittest.main(argv=sys.argv)
|
