Skip to content
#

nearest-neighbors

Here are 80 public repositories matching this topic...

The Traveling Salesman Problem (TSP) aims for the most efficient route across cities. This Python project, employing Tkinter and the Model-View-Controller (MVC) architecture, visualizes TSP solutions. It generates random cities, utilizes the nearest neighbor algorithm, and presents the optimal path with a Tkinter-based GUI.

  • Updated Jan 21, 2024
  • Python

Improve this page

Add a description, image, and links to the nearest-neighbors topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the nearest-neighbors topic, visit your repo's landing page and select "manage topics."

Learn more