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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
# unit tests for the cache module
# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
#
# This file is part of logilab-common.
#
# logilab-common is free software: you can redistribute it and/or modify it under
# the terms of the GNU Lesser General Public License as published by the Free
# Software Foundation, either version 2.1 of the License, or (at your option) any
# later version.
#
# logilab-common is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
# FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
# details.
#
# You should have received a copy of the GNU Lesser General Public License along
# with logilab-common. If not, see <http://www.gnu.org/licenses/>.
from logilab.common.testlib import TestCase, unittest_main
from logilab.common.graph import get_cycles, has_path, ordered_nodes, UnorderableGraph
class getCyclesTC(TestCase):
def test_known0(self):
self.assertEqual(get_cycles({1:[2], 2:[3], 3:[1]}), [[1, 2, 3]])
def test_known1(self):
self.assertEqual(get_cycles({1:[2], 2:[3], 3:[1, 4], 4:[3]}), [[1, 2, 3], [3, 4]])
def test_known2(self):
self.assertEqual(get_cycles({1:[2], 2:[3], 3:[0], 0:[]}), [])
class hasPathTC(TestCase):
def test_direct_connection(self):
self.assertEqual(has_path({'A': ['B'], 'B': ['A']}, 'A', 'B'), ['B'])
def test_indirect_connection(self):
self.assertEqual(has_path({'A': ['B'], 'B': ['A', 'C'], 'C': ['B']}, 'A', 'C'), ['B', 'C'])
def test_no_connection(self):
self.assertEqual(has_path({'A': ['B'], 'B': ['A']}, 'A', 'C'), None)
def test_cycle(self):
self.assertEqual(has_path({'A': ['A']}, 'A', 'B'), None)
class ordered_nodesTC(TestCase):
def test_one_item(self):
graph = {'a':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a',))
def test_single_dependency(self):
graph = {'a':['b'], 'b':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a','b'))
graph = {'a':[], 'b':['a']}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('b','a'))
def test_two_items_no_dependency(self):
graph = {'a':[], 'b':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a','b'))
def test_three_items_no_dependency(self):
graph = {'a':[], 'b':[], 'c':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a', 'b', 'c'))
def test_three_items_one_dependency(self):
graph = {'a': ['c'], 'b': [], 'c':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a', 'b', 'c'))
def test_three_items_two_dependencies(self):
graph = {'a': ['b'], 'b': ['c'], 'c':[]}
ordered = ordered_nodes(graph)
self.assertEqual(ordered, ('a', 'b', 'c'))
def test_bad_graph(self):
graph = {'a':['b']}
self.assertRaises(UnorderableGraph, ordered_nodes, graph)
if __name__ == "__main__":
unittest_main()
|
