You may post links to any useful test code you write which you feel other students might benefit from. Your program will be tested on a range of graphs of various sizes, most will be randomly generated. Over 15 vertices in 1 CPU minute is good, over 20 is excellent. The machines intended to be used for marking are those in labs moog, bell, leaf and spoons. No pair of components may overlap.
Problem details Each component is rectangular with height and width even integers.
Componants may not be rotated. Each pair of components has 0,1,2,3 or 4 wires between them. Any wires connected to a component attach at its center. Each of the regions is a square of side n , where n 2 is the smallest square number larger than the sum of the areas of all the components. Your Task Design and implement a simulated annealing algorithm to look for an optimum positioning of a set of components.