Travelling-Salesman-Problem-in-SQL

The goal of project is to find the cheapest route that visits all cities and returns to the starting point without loops. More detailed description attached in DESCRIPTION.md

Exercise 00: Task of Classical TSP

Directory and files

• ex00/team00_ex00

Used languages, programms ​​and stacks

• ANSI SQL
• PostgreSQL
• Recursive Query pattern

Exercise 01: Opposite TSP

• ex01/team00_ex01

Used languages, programms ​​and stacks

• ANSI SQL
• PostgreSQL
• Recursive Query pattern