0 votes
228 views
in Programming Languages & Algorithms by (user.guest)

1 Answer

+1 vote
by (user.guest)
selected by (user.guest)
 
Best answer

The travelling sales man problem is a mathematical problem that tasks one with finding the shortest path to travel through various cities, visiting each city only once and ending up at the origin point or city. The number of points is usually given, as well as the distance between them.

The travelling sales man problem (TSP) has been adapted in computer science, an example of this is using TSP to find the most efficient route for data to travel between various nodes.

by (user.guest)
Well explained. Thanks for sharing :)

Related questions

0 votes
1 answer 106 views
asked Nov 5, 2021 in Others by (user.guest)
0 votes
1 answer 205 views
asked Oct 25, 2021 in Software Engineering by (user.guest)
+1 vote
1 answer 231 views
0 votes
0 answers 90 views
+1 vote
1 answer 472 views
+1 vote
1 answer 453 views
0 votes
1 answer 8.8k views
+1 vote
1 answer 194 views
+1 vote
1 answer 194 views
asked Sep 23, 2021 in Others by anonymous
+1 vote
1 answer 366 views
+1 vote
1 answer 170 views
+1 vote
1 answer 180 views
+1 vote
1 answer 191 views
0 votes
1 answer 186 views
+1 vote
1 answer 162 views
+1 vote
1 answer 208 views
+1 vote
1 answer 522 views
+3 votes
1 answer 406 views
+2 votes
1 answer 1.4k views
+1 vote
1 answer 153 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...