从不同的列表中寻找两个坐标之间的最小距离

import math

def calculate_distance(coord1, coord2):
    # 计算两个坐标之间的距离
    x1, y1 = coord1
    x2, y2 = coord2
    distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
    return distance

def find_min_distance(coordinates):
    # 对坐标列表进行排序
    sorted_coordinates = sorted(coordinates)

    # 初始化最小距离为正无穷大
    min_distance = float('inf')

    # 遍历排序后的列表，计算最小距离
    for i in range(len(sorted_coordinates) - 1):
        distance = calculate_distance(sorted_coordinates[i], sorted_coordinates[i+1])
        if distance < min_distance:
            min_distance = distance

    return min_distance

# 示例坐标列表
coordinates = [(1, 2), (3, 4), (5, 6), (7, 8)]

# 调用函数计算最小距离
min_distance = find_min_distance(coordinates)

print("最小距离为:", min_distance)