daviddoji/pytudes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update TSP.ipynb

Browse Source
This commit is contained in:
Peter Norvig
2025-12-07 09:58:48 -08:00
committed by GitHub
parent 64d60e62ee
commit c562e477aa
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
ipynb/TSP.ipynb
View File

@@ -31,10 +31,10 @@
"\n", "\n",
"|   |   |\n", "|   |   |\n",
"|--------|--------|\n", "|--------|--------|\n",
"|*Given a **set of cities***|I'll represent them with a set of points in the (*x*, *y*) plane|\n", "|*Given a set of cities*|I'll represent them with a set of points in the (*x*, *y*) plane|\n",
"|*and the **distance** between each pair of cities*,|I'll define a function `distance(A, B)`|\n", "|*and the distance between each pair of cities*,|I'll define a function `distance(A, B)`|\n",
"|*what is the **shortest***| I'll use `shortest(tours)` to find this, and `tour_length(tour)` to compute the length of each candidate tour.|\n", "|*what is the shortest*| I'll use `shortest(tours)` to find this, and `tour_length(tour)` to compute the length of each candidate tour.|\n",
"|***tour***|A **tour** will be represented by a list. `[A, B, C]` is the tour from `A` to `B` to`C` and back to `A` . |\n", "|*tour*|A **tour** will be represented by a list. `[A, B, C]` is the tour from `A` to `B` to`C` and back to `A` . |\n",
"|*that visits each city exactly once, and returns to the starting city?*|The function `valid_tour(tour)` will check this.|\n", "|*that visits each city exactly once, and returns to the starting city?*|The function `valid_tour(tour)` will check this.|\n",
"\n", "\n",
"Four more basic concepts, implied by the definition:\n", "Four more basic concepts, implied by the definition:\n",