forked from pmatiello/python-graph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathunittests-cycles.py
More file actions
98 lines (79 loc) · 2.95 KB
/
Copy pathunittests-cycles.py
File metadata and controls
98 lines (79 loc) · 2.95 KB
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
90
91
92
93
94
95
96
97
98
# Copyright (c) Pedro Matiello <pmatiello@gmail.com>
#
# Permission is hereby granted, free of charge, to any person
# obtaining a copy of this software and associated documentation
# files (the "Software"), to deal in the Software without
# restriction, including without limitation the rights to use,
# copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the
# Software is furnished to do so, subject to the following
# conditions:
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
# OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
# HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
# WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
# OTHER DEALINGS IN THE SOFTWARE.
"""
Unittests for graph.algorithms.cycles
"""
import unittest
import pygraph
from pygraph.algorithms.cycles import find_cycle
from pygraph.algorithms.searching import depth_first_search
from pygraph.classes.digraph import digraph
from pygraph.classes.graph import graph
import testlib
def verify_cycle(graph, cycle):
for i in xrange(len(cycle)):
assert graph.has_edge(cycle[i],cycle[(i+1)%len(cycle)])
class test_find_cycle(unittest.TestCase):
# Graph
def test_find_cycle_on_graph(self):
gr = testlib.new_graph()
cycle = find_cycle(gr)
verify_cycle(gr, cycle)
def test_find_cycle_on_graph_withot_cycles(self):
gr = testlib.new_graph()
st, pre, post = depth_first_search(gr)
gr = graph()
gr.add_spanning_tree(st)
assert find_cycle(gr) == []
# Digraph
def test_find_cycle_on_digraph(self):
gr = testlib.new_digraph()
cycle = find_cycle(gr)
verify_cycle(gr, cycle)
def test_find_cycle_on_digraph_without_cycles(self):
gr = testlib.new_digraph()
st, pre, post = depth_first_search(gr)
gr = digraph()
gr.add_spanning_tree(st)
assert find_cycle(gr) == []
def test_find_small_cycle_on_digraph(self):
gr = digraph()
gr.add_nodes([1, 2, 3, 4, 5])
gr.add_edge(1, 2)
gr.add_edge(2, 3)
gr.add_edge(2, 4)
gr.add_edge(4, 5)
gr.add_edge(2, 1)
# Cycle: 1-2
assert find_cycle(gr) == [1,2]
# Regression
def test_regression1(self):
G = digraph()
G.add_nodes([1, 2, 3, 4, 5])
G.add_edge(1, 2)
G.add_edge(2, 3)
G.add_edge(2, 4)
G.add_edge(4, 5)
G.add_edge(3, 5)
G.add_edge(3, 1)
assert find_cycle(G) == [1, 2, 3]
if __name__ == "__main__":
unittest.main()