| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To reduce calculation time for finding out the minimum route of a weighted graph by parallel dispersion processing. <P>SOLUTION: By using a neural network consisting of an initial input part 11, delay parts 12-1 to 12-8 each of which has a memory for storing delay quantity corresponding to weight of each branch of a graph, output determination parts 13-1 to 13-4 corresponding to respective nodes of the graph, OR circuits 14-1 to 14-4, and a path storage part 15; a signal is transmitted to an output terminal of the initial input part 11, which corresponds to a target node, a signal outputted from the output terminal of the OR circuit is delayed by the delay quantity through the delay part and transmitted, only a signal obtained at first by each output determination part is transmitted to one output terminal, the information of a branch corresponding to an input terminal from which a signal is obtained at first is outputted to the other output terminal, and the information is stored in the path storage part 15 as a part of a minimum route from the node corresponding to the output determination part up to the target node. <P>COPYRIGHT: (C)2006,JPO&NCIPI</p> |
