path = [end] ordered_waypoints = [] current = end num_visited = min_num_visited for i in range(len(waypoints), 0, -1): if current in range(i): ordered_waypoints.insert(0, waypoints[i - 1]) num_visited -= 1 for neighbor, weight in enumerate(adj_matrix[current]): if weight > 0 and (neighbor, num_visited) in visited and distances[neighbor][num_visited] + weight == \ distances[current][num_visited]: path.append(neighbor) current = neighbor break ordered_waypoints.insert(0, start_cor) ordered_waypoints.append(end_cor) path.reverse() print("The optimal path from start to end through the 8 waypoints is:") for wp in ordered_waypoints: print(wp) print(f"The optimal path from start to end through the 8 waypoints is: {path}") print(f"The total distance is: {distances[end][min_num_visited]}")每行什么意思帮我加上注释

path = [end]  # 初始化路径，将终点加入路径
ordered_waypoints = []  # 初始化有序中间点列表
current = end  # 初始化当前节点为终点
num_visited = min_num_visited  # 初始化已访问中间点数量为最小值

# 从后向前遍历中间点
for i in range(len(waypoints), 0, -1):
    # 如果当前节点在当前遍历中的范围内
    if current in range(i):
        # 将当前中间点加入有序中间点列表
        ordered_waypoints.insert(0, waypoints[i - 1])
        # 已访问中间点数量减1
        num_visited -= 1
    # 针对当前节点的所有邻居
    for neighbor, weight in enumerate(adj_matrix[current]):
        # 如果邻居节点可达且已经访问过并且到达邻居节点的距离加上邻居节点到当前节点的距离等于到达当前节点的距离
        if weight > 0 and (neighbor, num_visited) in visited and distances[neighbor][num_visited] + weight == \
                distances[current][num_visited]:
            # 将邻居节点加入路径
            path.append(neighbor)
            # 更新当前节点为邻居节点
            current = neighbor
            # 退出循环
            break

# 将起点和终点加入有序中间点列表
ordered_waypoints.insert(0, start_cor)
ordered_waypoints.append(end_cor)

# 反转路径，使其从起点到终点
path.reverse()

# 输出结果
print("The optimal path from start to end through the 8 waypoints is:")
for wp in ordered_waypoints:
    print(wp)
print(f"The optimal path from start to end through the 8 waypoints is: {path}")
print(f"The total distance is: {distances[end][min_num_visited]}")