Travelling Salesman Problem using Dynamic Programming - Easiest Approach with Code

Coding Blocks is pleased to announce courses like C++ and Java, Data Structures and Algorithms, Web and Android Development(Java and Kotlin), Competitive Programming, Coding Interview Preparation and Machine Learning, AI and more.

#CodingBlocks #ProgrammingMadeEasy #LearnCodingOnline

[AbhishekKumar-yvih]

I watched all the videos of TSP (Abdul bari, William Fiset, Tushar Roy) . This is the best Explaination along with code.

[Firebolt]

I used the Hamiltonian cycle algorithm for my university's delivery service final project. It was the fastest delivery service out of every project submitted.

[ragingpahadi]

Bit Manipulation explanation saved lot of hair : ]. Thanks for such a elegant and simple explanation

[Thompzful]

Amazing tutorial, looked online for hours but this is definitely the best introduction to the tsp problem. :)

[persevere]

The best resource on the internet to understand the DP approach of TSP!!

[rahulkumarsinha]

Its really brilliant lectures on youtube. Coding blocks always rocks..

[tusharrawat]

Time complexity is O(n^2 * 2 ^ n) as we are filling each value in the dp table and to compute the optimal value for each cell in dp table we are traversing to all possible next cities which are n.

[katsaronas]

Very intuitive video. Can you give some information on how we can get a path in output?

[asmitpapney]

usually i don't comment much .... but this is seriously beautiful :)

[alexbeh]

The base case is a bit confusing to me. I think the correct value to return should be dist[pos][origin_pos] instead of dist[pos][0]. The answer is still correct for this example in this video because the origin_pos is queal to 0.

This is one of the best tutorial to explain the TSP solution🎉🎉🎉

[NickKMusic]

Is it possible to find also the path and not only the weight ?

[adhaarsharma]

Best Explaination on Travelling Salesman Problem.

[harshitanag]

Great video! However, I think it would also be worth mentioning that we are talking here about a Complete Graph.

[AbhishekKumar-yvih]

At 16:45, I can't see any overlapping subproblems. Can you give some example where I can see that?

[zahidirshad]

Being an algorithm analyst what do you think, "If TSP problem is solved by using dynamic programming approach, will it provide feasible solution better than greedy approach?

[ayushbhardwaj]

I loved it. You explained the bitmask concept soo well. :)

[RaviKant-llck]

Nice explanation but you should have printed path also.

[sheikhmkrifat]

i dont see anyoverlapping in recursive approach then why we need dynamic programming ?

[vm]

Thank you so much for the video! I had been looking for a good DP solution for a while now. And you explained it in great depth. Appreciate the work you have put in :)

[yatnbangad]

You've explained it soo nicely!!! Thank you so much!