Cidr4 merge algorithm #5
@@ -38,7 +38,7 @@ def ensure_no_neighbors(nodes: list[Node]):
|
|||||||
|
|
||||||
|
|
||||||
def merge_nodes(a: Node, b: Node) -> tuple[Node, int]:
|
def merge_nodes(a: Node, b: Node) -> tuple[Node, int]:
|
||||||
def find_parent(a, b) -> Node:
|
def find_parent(a, b):
|
||||||
ia, la = a
|
ia, la = a
|
||||||
ib, lb = b
|
ib, lb = b
|
||||||
min_l = min(la, lb)
|
min_l = min(la, lb)
|
||||||
|
|||||||
Reference in New Issue
Block a user