| 摘要 |
PURPOSE:To convert into vector and to perform the shortest route research of a network by dividing operation to be conducted at Wave Front into fan-out process and fan-in process and expressing the fan-in process by a pipe line of the second item arithmetic. CONSTITUTION:A controller 1 writes node group numbers (address) of the fan- out front of each node in a memory 2 and those of the fan-in front of each node in a memory 3, as structural data of a network. The controller 1 writes the condition of each node (a logical value, the shortest arrival distance from a start point) and arc attributes (length, etc.), and reads out each node condition from a memory 4 after completion of calculation by the controller 1. The arithmetic arrives a final point white repeating the fan out and fan in from the starting point, and computation is always performed at a border part (Wave Front) between the node whose condition is fixed and the node whose condition is not fixed. |
