TSP-GUI Solver

Developed a custom Qt C++ application to solve the Traveling Salesman Problem (TSP) across Egyptian cities. The project focused on algorithm efficiency, UI design, and real-time visualization.

Key Algorithms

Greedy Algorithm: For quick route approximations

Brute Force: For exact solutions on smaller datasets

Held-Karp (Dynamic Programming): For optimal and scalable pathfinding

Features

Interactive GUI with clean design and smooth animations

Supports both coordinate input and map-based interaction

Displays routes and total distance dynamically

? Development Focus

Built an intuitive, responsive Qt interface

Implemented and optimized multiple TSP algorithms

Conducted testing to ensure correctness and performance