Skip to content

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

Notifications You must be signed in to change notification settings

burakikanyildiz/EnhancedSalesmanProblem

Repository files navigation

Enhanced Salesman Problem

Please check out EnhancedSalesmanProblem.pdf for description of the project.

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

About

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages