SQL projects in School21 (BootCamp, team projects)
-
Updated
Dec 7, 2023 - PLpgSQL
SQL projects in School21 (BootCamp, team projects)
solves the classic traveling salesman problem (TSP) using SQL without loops: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the original city?
To associate your repository with the s21-sql topic, visit your repo's landing page and select "manage topics."