Steps to run:
- Set the height and width of the graph in main.c
- Set the start and end of the graph in main.c
- Select one of DFS_SEQ, DFS_PAR, BFS_SEQ, BFS_PAR, A_SEQ, A_PAR as the search algorithm in main.c
- make all on command line
- ./output to view the results
Run on Eight-core, 3.0 GHz Intel Core i7 processor
Parallel A* had 7x speedup (over sequential A*) for 10^6 nodes and 137x speedup (over sequential A*) for 10^8 nodes
| Sequential Version | Parallel Version run with 8 threads |
 |
 |
Parallel Breadth First Search (all speedups compared to sequential version), 2.7x speedup for 10^8 nodes, 3x speedup for 10^7 nodes, 1.3x speedup for 10^6 nodes
| Sequential Version | Parallel Version run with 8 threads |
 |
 |