Simulation for our routing algorithm and comparing it with two others algorithms.
- g++ compiler.
- java IDE(eclipse, IntelliJ, ...).
- Run netsRegions file with inputs chipSizex, ChipSizey, regionSizex, regionSizey and netsNum. for example:
$ g++ netsRegions.cpp -o netsRegions
$ ./netsRegions 15 20 4 3 20
The output will be in file called "Nets.txt" and the output contains pairs of lines. each pair descripes a net, The first line in the pair is the start and end points for the net, the second line contains the regions that net paths by.
- Run the java project with IDE(eclipse, IntelliJ, ...) and get the output (running time).