Travelling Salesmen problem solved using A* Search algorithm for AI class.
First off with the github basics:
* Clone this project into your local repository
* pull
There are two modes for this program.
- User Interface Mode
- Data Generator Mode
This mode allow you to specify which input you want to give to the algorithm. You can choose from a list within randTSP folder.
This returns the number of nodes expanded and the solution to the specified problem.
Run these two commands from your shell.
* make ui
* ./ui
This mode generates a list of number of nodes and the average node expanded for those many nodes.
This returns 2 columns of data in the form of 'Number of Nodes' 'Number of Nodes Expanded in the Search'
Run these two commands from your shell.
* make data
* data
To generate both executable at the same time, you can just run
make
Now that you have ran the program, you might want to remove the executable and those pesky .d files. Simply run
clean