| 摘要 |
PURPOSE:To detect a pair of a starting-point and an ending-point node having the maximum cost in a logical network in a short time by composing a data processor of a node selection control part, maximum cost arithmetic part, output part, etc. CONSTITUTION:Data which represents the logical network in a directional graph are inputted externally to the node selection control part 1. The control part 5 stores starting-point nodes among those data in a starting node storage part 2, and all nodes including the starting-point nodes in a node storage part 3. A tracing control part 4 reads nodes out of the storage part 2 all the time after the storage and detects the node connected to the nodes in the storage part 3. The maximum cost arithmetic part 5 calculates the maximum cost up to the node that the node read out of the storage part 2 has. When the detected node is the ending-point node, a node judgement part 6 sends a pair of the starting- point node and ending point node having the maximum cost to a node storage part 7. Then, said pairs stored in the storage part 7 are outputted successively by an output part 8. |
