GitHub - gorkemozsari/Traveling-Salesman-Problem: TSP is a well known NP Complete Problem. I wrote shortest path graph function, BFS and UCS for TSP

gorkemozsari / Traveling-Salesman-Problem Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

TSP is a well known NP Complete Problem. I wrote shortest path graph function, BFS and UCS for TSP

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitattributes		.gitattributes
Readme.txt		Readme.txt
a.py		a.py
input.txt		input.txt
tsp.py		tsp.py

Repository files navigation

Görkem Özsarı

Program has 2 main functions.
1. Creating shortest path graph from given input
2. Finding solutions to Traveling Salesman Problem using Breath First Search and Uniform Cost Search

Function 2 is not possible without doing Function 1 first.

Used Pyhthon as language and Visual Studio Code for platform. The code can be run and compiled using other platforms as well.

However, it is important to open the code with folder. If not, the code will not be able to see input.txt file.

At least it does not see it on Visual Studio Code.