在算法中，我们采用最短路径优先原则，每次选择当前PE到下一个连接PE的

In the algorithm, we adopt the shortest path first principle, and each time we select the PE with the smallest hypotenuse distance from the current PE to the next connected PE, until it is connected to the target PE. This ensures that fewer PEs are accessed, while reducing the number of long connections to the logic array. The hypotenuse distance is expressed as the absolute value of the difference between the column number of the next connected PE and the column number of the current PE. When the successor PEs have the same hypotenuse distance, choose the right successor PEs as much as possible to ensure that there are enough PEs on the left to construct the logical column, so that the size of the logical array is not lost as much as possible. In Algorithm 2, the list is a priority queue, and the nodes in it are tracked to find the next node with the smallest hypotenuse distance. extract_min means to find and extract the elements of the hypotenuse distance in the list. Start from the initial node S and set the hypotenuse distance of S to 0. If the intermediate successor is not faulty, select the intermediate successor as the next connected PEs, otherwise look for the node with the smallest hypotenuse distance to both sides of the node, and record the node's ·The hypotenuse distance, and put it in the list, repeat the operation until you find the path of PE in the target row.

In the algorithm, we use the shortest path priority principle, each time we select the current PE to the next connection PE with the smallest bevel distance PE, until it is connected to the target PE. This ensures less access to PEs while reducing the number of long connections to the logical array. The bevel distance represents the absolute value of the difference between the column number of the next connected PE and the column number of the current PE. When the successor PEs have the same slope distance, select the right-hand successor PEs as far as possible to ensure that there are enough PEs on the left to build logical columns so that the size of the logical array is not lost as much as possible. In Algorithm 2, the list is a priority queue and tracks the nodes in it to find the next node with the minimum bevel distance. extract_min represents the element that finds and extracts the bevel distance in the list. Starting with the initial node S and setting the slope distance of S to 0, if there is no failure in the middle successor, select the middle successor as the next connected PEs, otherwise look for the node with the smallest bevel distance on either side of the node, record the slope distance of the node, and put it in the list and repeat the operation until the path of PE in the target row is found.

在算法中，我们采用最短路径优先原则，每次选择当前PE到下一个连接PE的斜边距离最小的PE，直到它连接到目标PE。这可以确保访问更少的PEs，同时减少到逻辑阵列的长连接数量。斜边距离表示为下一个连接的PE的列号与当前PE的列号之差的绝对值。当后继PEs具有相同的斜边距离时，尽可能选择靠右的后继PEs，确保在左边有足够多的PEs构建逻辑列，使得逻辑数组的规模尽量不流失。在算法2中，列表是一个优先队列，并跟踪其中的节点，以找出下一个具有最小斜边距离的节点。extract_min表示查找并提取列表中斜边距离的元素。从初始节点S开始，并设置S的斜边距离为0，如果中间后继没有故障，选择中间的继任者作为下一个连接的PEs，否则向节点两侧寻找斜边距离最小的节点，记录节点的·斜边距离，并将其放入列表中，重复操作，直到找到目标行中PE的路径。<br>