| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To quickly process the design of a communication path of a communication network for realizing a highly efficient failure restoration system 1:N system. <P>SOLUTION: A communication network design circuit is configured to be k-edge-connected as a topology of a communication network when a group of vertexes and a value of k are applied, and to output a graph whose costs are the minimum, and to have a next candidate preparation processing part for automatically ensuring that this circuit is the k-edge-connected. Thus, it is possible to eliminate a decision part for deciding whether or not this circuit is k-edge-connected each time graph deformation which used to be the bottle- neck of a calculating time in a conventional technology, is executed. <P>COPYRIGHT: (C)2003,JPO</p> |
