如何计算水平线和树线树状图python之间的交叉点

def calculate_intersection(horizontal_line, tree_line):
    intersections = []
    x1, y1, x2, y2 = horizontal_line

    for node, parent in tree_line.items():
        if parent is not None:
            x3, y3 = node
            x4, y4 = parent

            if min(x1, x2) <= max(x3, x4) and min(x3, x4) <= max(x1, x2) and \
               min(y1, y2) <= max(y3, y4) and min(y3, y4) <= max(y1, y2):
                # Calculate the intersection point
                intersection_x = ((x3*y4 - x4*y3)*(x2 - x1) - (x1*y2 - x2*y1)*(x4 - x3)) / \
                                 ((x1 - x2)*(y3 - y4) + (x3 - x4)*(y1 - y2))
                intersection_y = ((x1*y2 - x2*y1)*(y3 - y4) - (x3*y4 - x4*y3)*(y1 - y2)) / \
                                 ((x1 - x2)*(y3 - y4) + (x3 - x4)*(y1 - y2))

                intersections.append((intersection_x, intersection_y))

    return intersections

# 示例数据
horizontal_line = (0, 1, 5, 1)
tree_line = {(1, 2): (2, 3), (2, 3): (3, 4), (3, 4): (4, 5), (4, 5): None}

# 计算交叉点
intersections = calculate_intersection(horizontal_line, tree_line)

# 打印结果
for intersection in intersections:
    print(f"交叉点坐标：{intersection}")