Maze Routing based on the A-star search
In our implementation, we use Cmake to compile the overall program.
$ cd src
$./scripts/build.py -o release
Then the executable file
$cd bin
$./hw3 <in_file_path> <out_file_path>
For example, if we want to run the maze router on ibm01.modified.txt, we could run:
$ ./hw3 ../testcase/ibm01.modified.txt ../output/ibm01.modified.out
The routing result for the case would be generated at ../output/ibm01.modified.out file.
The rip-up-and-reroute algorithm would be developed if having time.