gurkandemir / Improved-Salesman-Problem

Improved Dijkstra's algorithm in order to find the shortest path in which there are various obstacles and restrictions.

How to compile

In a terminal, call commands:

>cmake CMakeLists.txt

>make

OR

>cmake CMakeLists.txt && make

Make sure the executable is produced.

Then you can test the project with the command:

>./project3 inputFile outputFile