| 摘要 |
PURPOSE:To rapidly obtain an approximate solution by outputting a tree for satisfying the capacity condition of a branch from the shape and the conditions of a network. CONSTITUTION:After data from a network data storage unit 6 is read by a data reader 1, a shortest route tree from a point becoming a center from the relationship between the point given by a shortest route tree generator 2 and the capacity of the branch as a starting point is generated. A boundary point retrieving unit 3 lists boundary points of the partial trees of the shortest route tree, and a boundary point input unit 4 includes the listed boundary points in any partial tree. Thereafter, information of the tree obtained by the unit 4, i.e., the branch for forming the tree is written in a tree data storage unit 7 by a data writer 5. |
