| 摘要 |
PURPOSE:To obtain plural different compaction results from one layout by making the length of a branch of a limit graph variable. CONSTITUTION:An initial layout, the number of results of compaction, the number of times of required compaction to obtain a compaction result, a table of a character string representing the direction of compaction, and a table of a parameter of real number not negative for each compaction are inputted from an input section 2. An extraction section 3 of a graph, a random number generating section 4, a decomposition section 5 of graph, a calculation section of the length of the branch 6, a longest path retrieval section 7, and a replacement section 8 of layout are operated in this order and the compaction result is outputted from an output section 9. A selection section 10 selects the result representing the least area of a rectangle surrounding the layout from the outputted compaction result as the optimum result.
|
