Question: b. Dijkstras algorithm calculates the shortest path, why is Dijkstra is not suitable to solve Travelling Salesman Problem ? c. What does dynamic programming have
b. Dijkstras algorithm calculates the shortest path, why is Dijkstra is not suitable to solve Travelling Salesman Problem ?
c. What does dynamic programming have in common with divide-and-conquer? What is a principal difference between them?
Please I need your help with these questions
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
