@@ -139,7 +139,7 @@ def test_build_single_node(self, gen_graph):
139139 assert len (children ) == 1 and children [0 ] == to_label (cg , 1 , 0 , 0 , 0 , 0 )
140140 # Make sure there are not any more entries in the table
141141 # include counters, meta and version rows
142- assert len (res .rows ) == 1 + 1 + 1 + 1 + 1
142+ assert len (res .rows ) == 1 + 1 + 1 + 1 + 1 + 1
143143
144144 @pytest .mark .timeout (30 )
145145 def test_build_single_edge (self , gen_graph ):
@@ -192,7 +192,7 @@ def test_build_single_edge(self, gen_graph):
192192
193193 # Make sure there are not any more entries in the table
194194 # include counters, meta and version rows
195- assert len (res .rows ) == 2 + 1 + 1 + 1 + 1
195+ assert len (res .rows ) == 2 + 1 + 1 + 1 + 1 + 1
196196
197197 @pytest .mark .timeout (30 )
198198 def test_build_single_across_edge (self , gen_graph ):
@@ -294,7 +294,7 @@ def test_build_single_across_edge(self, gen_graph):
294294
295295 # Make sure there are not any more entries in the table
296296 # include counters, meta and version rows
297- assert len (res .rows ) == 2 + 2 + 1 + 3 + 1 + 1
297+ assert len (res .rows ) == 2 + 2 + 1 + 3 + 1 + 1 + 2
298298
299299 @pytest .mark .timeout (30 )
300300 def test_build_single_edge_and_single_across_edge (self , gen_graph ):
@@ -402,7 +402,7 @@ def test_build_single_edge_and_single_across_edge(self, gen_graph):
402402
403403 # Make sure there are not any more entries in the table
404404 # include counters, meta and version rows
405- assert len (res .rows ) == 3 + 2 + 1 + 3 + 1 + 1
405+ assert len (res .rows ) == 3 + 2 + 1 + 3 + 1 + 1 + 2
406406
407407 @pytest .mark .timeout (120 )
408408 def test_build_big_graph (self , gen_graph ):
0 commit comments