Answer Happy

Posted: **Sat May 14, 2022 4:04 pm**

: 4 2 A Consider The Problem Of Finding The Shortest Path In A City Map Starting From A Point A And Terminating At A 1 (28.43 KiB) Viewed 64 times

- 4- 2. (a) Consider the problem of finding the shortest path in a city map starting from a point A and terminating at a point B. Is this a travelling salesman problem (TSP)? Justify your answer, also referring to the computational complexity of the problem. [6 marks)