These test core dump on my machine, lowering the node amount

regebro · regebro · commit 1405d3b840ff · 2018-01-23T18:23:04.000+01:00
diff --git a/tests/unittests-cycles.py b/tests/unittests-cycles.py
@@ -44,7 +44,7 @@ def verify_cycle(graph, cycle):
 class test_find_cycle(unittest.TestCase):
 
     # Graph
-    
+
     def test_find_cycle_on_graph(self):
         gr = testlib.new_graph()
         cycle = find_cycle(gr)
@@ -58,19 +58,19 @@ def test_find_cycle_on_graph_withot_cycles(self):
         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])
@@ -81,18 +81,18 @@ def test_find_small_cycle_on_digraph(self):
         gr.add_edge((2, 1))
         # Cycle: 1-2
         assert find_cycle(gr) == [1,2]
-    
+
     def test_find_cycle_on_very_deep_graph(self):
         gr = pygraph.classes.graph.graph()
-        gr.add_nodes(range(0,20001))
-        for i in range(0,20000):
+        gr.add_nodes(range(0,15001))
+        for i in range(0,15000):
             gr.add_edge((i,i+1))
         recursionlimit = getrecursionlimit()
         find_cycle(gr)
         assert getrecursionlimit() == recursionlimit
 
     # Regression
-    
+
     def test_regression1(self):
         G = digraph()
         G.add_nodes([1, 2, 3, 4, 5])
@@ -103,6 +103,6 @@ def test_regression1(self):
         G.add_edge((3, 5))
         G.add_edge((3, 1))
         assert find_cycle(G) == [1, 2, 3]
-        
+
 if __name__ == "__main__":
-    unittest.main()
+    unittest.main()
diff --git a/tests/unittests-searching.py b/tests/unittests-searching.py
@@ -44,7 +44,7 @@ def test_dfs_in_empty_graph(self):
         assert st == {}
         assert pre == []
         assert post == []
-    
+
     def test_dfs_in_graph(self):
         gr = testlib.new_graph()
         st, pre, post = depth_first_search(gr)
@@ -61,7 +61,7 @@ def test_dfs_in_empty_digraph(self):
         assert st == {}
         assert pre == []
         assert post == []
-    
+
     def test_dfs_in_digraph(self):
         gr = testlib.new_digraph()
         st, pre, post = depth_first_search(gr)
@@ -71,11 +71,11 @@ def test_dfs_in_digraph(self):
                 assert post.index(each) < post.index(st[each])
         for node in st:
             assert gr.has_edge((st[node], node)) or st[node] == None
-    
+
     def test_dfs_very_deep_graph(self):
         gr = pygraph.classes.graph.graph()
-        gr.add_nodes(range(0,20001))
-        for i in range(0,20000):
+        gr.add_nodes(range(0,15001))
+        for i in range(0,15000):
             gr.add_edge((i,i+1))
         recursionlimit = getrecursionlimit()
         depth_first_search(gr, 0)
@@ -88,7 +88,7 @@ def test_bfs_in_empty_graph(self):
         st, lo = breadth_first_search(gr)
         assert st == {}
         assert lo == []
-    
+
     def test_bfs_in_graph(self):
         gr = pygraph.classes.graph.graph()
         gr = testlib.new_digraph()
@@ -104,7 +104,7 @@ def test_bfs_in_empty_digraph(self):
         st, lo = breadth_first_search(gr)
         assert st == {}
         assert lo == []
-    
+
     def test_bfs_in_digraph(self):
         gr = testlib.new_digraph()
         st, lo = breadth_first_search(gr)
@@ -113,6 +113,6 @@ def test_bfs_in_digraph(self):
                 assert lo.index(each) > lo.index(st[each])
         for node in st:
             assert gr.has_edge((st[node], node)) or st[node] == None
-            
+
 if __name__ == "__main__":
-    unittest.main()
+    unittest.main()
diff --git a/tests/unittests-sorting.py b/tests/unittests-sorting.py
@@ -42,22 +42,22 @@ def test_topological_sorting_on_tree(self):
         st, pre, post = depth_first_search(gr)
         tree = pygraph.classes.digraph.digraph()
 
-        
+
         for each in st:
             if st[each]:
                 if (each not in tree.nodes()):
                     tree.add_node(each)
                 if (st[each] not in tree.nodes()):
                     tree.add_node(st[each])
                 tree.add_edge((st[each], each))
-        
+
         ts = topological_sorting(tree)
         for each in ts:
             if (st[each]):
                 assert ts.index(each) > ts.index(st[each])
-    
+
     def test_topological_sorting_on_digraph(self):
-        
+
         def is_ordered(node, list):
             # Has parent on list
             for each in list:
@@ -69,22 +69,22 @@ def is_ordered(node, list):
                 if (each in st):
                     return False
             return True
-            
+
         gr = testlib.new_digraph()
         ts = topological_sorting(gr)
-        
+
         while (ts):
             x = ts.pop()
             assert is_ordered(x, ts)
 
     def test_topological_sort_on_very_deep_graph(self):
         gr = pygraph.classes.graph.graph()
-        gr.add_nodes(range(0,20001))
-        for i in range(0,20000):
+        gr.add_nodes(range(0,15001))
+        for i in range(0,15000):
             gr.add_edge((i,i+1))
         recursionlimit = getrecursionlimit()
         topological_sorting(gr)
         assert getrecursionlimit() == recursionlimit
-            
+
 if __name__ == "__main__":
-    unittest.main()
+    unittest.main()
