Traveling Salesman Problem

Use sliders to set the edge value for a Hamilton Circuit of 5 cities. Select the edges to see the total weight using an algorithm such as Brute Force, Nearest Neighbor, Repetitive Nearest Neighbor and Cheapest Link.

 

GeoGebra Materials Team

 
Baliabide-mota
Lan-orria
Fitxak
problem  salesman 
Helburu-taldea (adina)
15 – 18
Hizkuntza
English (United States)
 
 
Ikustaldiak
4043
Contact author of resource
Lizentzia
CC-BY-SA, GeoGebra Terms of Use
Baliabide Eratorriak
ibdp.maths.noncore.book.3.16.geogebra.02.AIHL
Honek partekatua: Kognity
 
 
© 2025 International GeoGebra Institute