公交车站有向邻接表计算代码

def build_connection_matrix(routes):
    # 收集所有唯一的站点
    all_stations = set()
    for route in routes:
        all_stations.update(route)
    sorted_stations = sorted(all_stations)
    # 创建站点到索引的映射
    station_index = {station: idx for idx, station in enumerate(sorted_stations)}
    n = len(sorted_stations)
    # 初始化连接矩阵
    matrix = [[0] * n for _ in range(n)]

    # 处理每条路线
    for route in routes:
        # 遍历所有可能的起点和终点对（i < j）
        for i in range(len(route)):
            for j in range(i + 1, len(route)):
                start = route[i]
                end = route[j]
                # 获取对应的矩阵索引
                row = station_index[start]
                col = station_index[end]
                matrix[row][col] += 1

    return matrix, sorted_stations


# 示例用法
if __name__ == "__main__":
    # 示例公交路线
    routes = [
        ['A', 'B', 'C'],
        ['B', 'A', 'D']
    ]

    matrix, stations = build_connection_matrix(routes)
    print("站点顺序:", stations)
    print("连接矩阵:")
    for row in matrix:
        print(row)