Update utils.py

utils.py

@@ -240,26 +240,32 @@ def is_there_a_directed_edge(a, b, rects):
     rectB = rects[b]
     centre_of_A = [rectA[0] + (rectA[2] - rectA[0]) / 2, rectA[1] + (rectA[3] - rectA[1]) / 2]
     centre_of_B = [rectB[0] + (rectB[2] - rectB[0]) / 2, rectB[1] + (rectB[3] - rectB[1]) / 2]
+
+    # Change starting preference to favor left-to-right
     if np.allclose(np.array(centre_of_A), np.array(centre_of_B)):
-        return box(*rectA).area > (box(*rectB)).area
-    copy_A = [rectA[0], rectA[1], rectA[2], rectA[3]]
-    copy_B = [rectB[0], rectB[1], rectB[2], rectB[3]]
-    while True:
-        if is_strictly_above(copy_A, copy_B) and not is_strictly_left_of(copy_A, copy_B):
-            return 1
-        if is_strictly_above(copy_B, copy_A) and not is_strictly_left_of(copy_B, copy_A):
-            return 0
-        if is_strictly_right_of(copy_A, copy_B) and not is_strictly_below(copy_A, copy_B):
-            return 1
-        if is_strictly_right_of(copy_B, copy_A) and not is_strictly_below(copy_B, copy_A):
-            return 0
-        if is_strictly_below(copy_A, copy_B) and is_strictly_right_of(copy_A, copy_B):
-            return use_cuts_to_determine_edge_from_a_to_b(a, b, rects)
-        if is_strictly_below(copy_B, copy_A) and is_strictly_right_of(copy_B, copy_A):
-           return use_cuts_to_determine_edge_from_a_to_b(a, b, rects)
-        # otherwise they intersect
-        copy_A = erode_rectangle(copy_A, 0.05)
-        copy_B = erode_rectangle(copy_B, 0.05)
+        return box(*rectA).area > box(*rectB).area
+    
+    # Prefer strictly left-of to strictly right-of
+    # This prioritizes left-to-right spatial relationship checks
+    if is_strictly_left_of(rectA, rectB) and not is_strictly_below(rectA, rectB):
+        return True
+    if is_strictly_left_of(rectB, rectA) and not is_strictly_below(rectB, rectA):
+        return False
+    
+    # Rest of the conditions (vertical directionality) remain the same
+    if is_strictly_above(rectA, rectB) and not is_strictly_left_of(rectA, rectB):
+        return True
+    if is_strictly_above(rectB, rectA) and not is_strictly_left_of(rectB, rectA):
+        return False
+    if is_strictly_below(rectA, rectB) and is_strictly_right_of(rectA, rectB):
+        return use_cuts_to_determine_edge_from_a_to_b(a, b, rects)
+    if is_strictly_below(rectB, rectA) and is_strictly_right_of(rectB, rectA):
+        return use_cuts_to_determine_edge_from_a_to_b(a, b, rects)
+
+    # Erosion as a fallback if intersecting
+    copy_A = erode_rectangle(rectA, 0.05)
+    copy_B = erode_rectangle(rectB, 0.05)
+    return box(*copy_A).area > box(*copy_B).area
     
 def get_distance(rectA, rectB):
     return box(rectA[0], rectA[1], rectA[2], rectA[3]).distance(box(rectB[0], rectB[1], rectB[2], rectB[3]))