4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula

Traveling Salesman Problem - Dynamic Programming - Explained using Formula

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[Nex_Addo]

You are going to single-handedly get me through my algorithms course. It's so clear, almost obvious, when you explain these things, where seemed so murky when I first heard them. Very much appreciated.

[ayasswain]

The best algorithm explaining teacher I have ever seen. Thanks Abdul Bari sir.

[niranjanreddy]

Abdul Bari sir I randomly landed in your page, after that I cant stop myself from binge watching all your Algo videos, your videos are amazing n Iam loving it

[arpitaarpi]

Dear sir,
This semester is very short, 3 months approximately
So our professor can't complete the whole syllabus
But our college professor is referring your channel for learning
You are awesome sir❤

[Deepak-jkeh]

this video is much clear than previous one
give a medal to this man

[AnitShrestha]

Thank you.

I found deriving the formula, than implementing one more effective. But it was nice to see the other way as well.

[SadisticShade]

For my own reference:
final path : {1, 2, 4, 3, 1}

[srinivb]

As usual AWESOME explanation by Abdul Bari sir. Kudos to you for explaining complex topics in easy and simple terms.

[rohitkandula]

You are a divine god for me, tomorrow i have exam learning today from ur channel😊✨🔥

[vishalc]

00:01 Explaining the traveling salesman problem using dynamic programming formula.
02:15 The formula explains how to find the minimum cost for visiting the remaining vertices.
04:12 Finding the minimum value by using dynamic programming formula
06:06 Dynamic programming for solving traveling salesman problem
08:27 Discussing the recursive tree execution for solving the traveling salesman problem using dynamic programming.
10:27 Dynamic programming is done with tabular values.
12:43 Finding smallest values first using dynamic programming
14:47 The shortest route for the Traveling Salesman Problem using Dynamic Programming is 35.

[sarfarazbaig]

I got more benefits by learning from this video, it is very nice video👌.

[shanerelish]

thank you so much for this video.. i was a little confused with the formula..
now i feel dumb for not understanding it before.. 😅

[theperennialbaker]

Awesome explanation Sir... 👍👌

Thanks alot... 💕

[anandbaskaran]

In an iterative approach, you can simply solve it as you show in the tree diagram.

[nikhilkumarjamwal]

Long but easy question with awesome explanation!💫

[vishaladithya]

thank you sir for your easy explanation. the topics which i felt hard in class, you explained it so understandable.

[vakhariyajay]

Thank you very much. You are a genius. 👍👍🔝🔝🙏🙏👌👌

[fatimamaj]

Thanks for the tutorial. I would like to just add one note. Maybe it is better to go through tree as Depth-first search not Breadth-first search, because I think recursive algorithm use Depth-first Search.

[AnkitSoni-vmod]

Your algorithm lectures is really awesome....!!

[ashishg]

Very good explanation, watched lot of videos :) Thanks a lot for such awesome content.