My teacher gave us a list of countries and asked us to find the shortest path(visits all the nodes exactly once) in the shortest time possible. I've created a matrix whose vertices are countries and edges are flights between them (weights are the amount of time for each flight). But I have no idea how to do this exercise.
0
votes
1 Answers
0
votes
It sounds like travelling salesman problem. You can search it for yourself, there are several solutions on the web for it.
