Travelling sales person
Algorithm project
where I solved the classic problem of the
Traveling Sales Person.
The goal
is to find the
shortest route
between
all cities
on a map and
end up in the starting city
. Each city may only be
visited once
(except for the starting city).
The problem was solved with a modified Dijkstra algorithm, using a priority queue with a min-heap data structure.
The project was also exported to Android .
The problem was solved with a modified Dijkstra algorithm, using a priority queue with a min-heap data structure.
The project was also exported to Android .
