| 摘要 |
PURPOSE:To check whether a maximum cost is within an allowable maximum cost of a terminal node or not in a short time by detecting a pair of a start node and the terminal node having the maximum cost in a logical circuit network. CONSTITUTION:Data obtained by expressing the logical circuit network with a directed graph is inputted from the external to a node selector control part 1 by a data bus 10, and start node are stored in a start node storage part 2, and all nodes including start nodes are stored in a node storage part 3. Nodes are taken out successively by a trace control part 4, and a pair of the start node and the terminal node having the maximum cost is searched while rewriting contents of the start node storage part 2 and the node storage part 3 by outputs of a maximum cost operating part 5 and a node discriminating part 6, which discriminates terminal nodes, and is stored in a pair node storage part 7. When this operation is terminated for all start nodes, the maximum cost is compared with a guaranteed maximum cost by a maximum cost checking part 8. |
