Problem 1.1.1, Problem 1.1.2, and Problem 1.1.3
Here's the third installment of the questionnaire I came across in this wonderful book about algorithms, introduction to algorithms, 2nd edition, MIT press.
Before going to wiki I guessed this:
Shortest path problem is about finding shortest path through bunch of the nodes or points or towns.
Travelling salesman problem is about finding shortest path and come back home like boomerang.
Well, I don't know much about it. What ever. Will read upon it.
Here's the third installment of the questionnaire I came across in this wonderful book about algorithms, introduction to algorithms, 2nd edition, MIT press.
How are the shortest-path and traveling-salesman problems given above similar? How areWhat is shortest path problem?
they different?
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.And what is travelling salesman problem?
The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find the shortest possible route that visits each city exactly once and returns to the origin city. It is a special case of the travelling purchaser problem.
Before going to wiki I guessed this:
Shortest path problem is about finding shortest path through bunch of the nodes or points or towns.
Travelling salesman problem is about finding shortest path and come back home like boomerang.
Well, I don't know much about it. What ever. Will read upon it.
No comments:
Post a Comment