Abstract: In a graphic layout system, a terminal constraint graph generator (104) prepares terminal constraint graph data with component terminals (except routes) as one and the other nodes. Calculation is made of a limit of movement of the one node towards the other node in a moving direction with a routing zone interposed therebetween. The routing zone has a width equal to a sum of the width of a route or routes in the routing zone and a necessary gap. The limit of movement is memorized as a component relative movement limit length. The terminal constraint graph generator (104) prepares component constraint graph data recording as a graph length a minimum value of the component relative movement limit length with respect to the same component terminals. By the use of the component constraint graph data, a component compactor (107) compacts the arrangement of components.